./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/substring-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/substring-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 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:45:00,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:45:00,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:45:00,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:45:00,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:45:00,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:45:00,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:45:00,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:45:00,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:45:00,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:45:00,842 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:45:00,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:45:00,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:45:00,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:45:00,845 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:45:00,846 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:45:00,846 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:45:00,846 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:45:00,846 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:45:00,846 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:45:00,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:45:00,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:45:00,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:45:00,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:45:00,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:45:00,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:45:00,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:45:00,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:45:00,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:45:00,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:45:00,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:45:00,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:45:00,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:45:00,853 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:45:00,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:45:00,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:45:00,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:45:00,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:45:00,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:45:00,855 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:45:00,856 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e [2024-11-10 22:45:01,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:45:01,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:45:01,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:45:01,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:45:01,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:45:01,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2024-11-10 22:45:02,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:45:02,801 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:45:02,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2024-11-10 22:45:02,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9774108c2/2320d62cdc184090bafaf419320717b2/FLAG668ce6825 [2024-11-10 22:45:02,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9774108c2/2320d62cdc184090bafaf419320717b2 [2024-11-10 22:45:02,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:45:02,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:45:02,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:02,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:45:02,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:45:02,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:02" (1/1) ... [2024-11-10 22:45:02,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5d5e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:02, skipping insertion in model container [2024-11-10 22:45:02,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:02" (1/1) ... [2024-11-10 22:45:02,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:45:03,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:03,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:45:03,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:03,260 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:45:03,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03 WrapperNode [2024-11-10 22:45:03,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:03,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:03,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:45:03,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:45:03,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,313 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2024-11-10 22:45:03,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:03,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:45:03,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:45:03,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:45:03,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,342 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 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]. [2024-11-10 22:45:03,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:45:03,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:45:03,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:45:03,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:45:03,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (1/1) ... [2024-11-10 22:45:03,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:03,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:03,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 22:45:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:45:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:45:03,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:45:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:45:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:45:03,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:45:03,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:45:03,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:45:03,573 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:45:03,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:45:03,725 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~ret19#1;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2024-11-10 22:45:03,739 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 22:45:03,739 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:45:03,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:45:03,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:45:03,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:03 BoogieIcfgContainer [2024-11-10 22:45:03,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:45:03,751 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:45:03,751 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:45:03,755 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:45:03,756 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:03,756 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:45:02" (1/3) ... [2024-11-10 22:45:03,757 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392bdc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:03, skipping insertion in model container [2024-11-10 22:45:03,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:03,758 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:03" (2/3) ... [2024-11-10 22:45:03,759 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392bdc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:03, skipping insertion in model container [2024-11-10 22:45:03,759 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:03,759 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:03" (3/3) ... [2024-11-10 22:45:03,760 INFO L332 chiAutomizerObserver]: Analyzing ICFG substring-alloca-2.i [2024-11-10 22:45:03,811 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:45:03,811 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:45:03,811 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:45:03,811 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:45:03,811 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:45:03,811 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:45:03,812 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:45:03,812 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:45:03,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:03,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-10 22:45:03,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:03,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:03,832 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:45:03,832 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:45:03,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:45:03,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:03,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-10 22:45:03,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:03,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:03,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:45:03,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:45:03,838 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 17#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 11#L532true assume !(main_~length1~0#1 < 1); 7#L535true assume !(main_~length2~0#1 < 1); 15#L538true call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 8#L541-1true [2024-11-10 22:45:03,839 INFO L747 eck$LassoCheckResult]: Loop: 8#L541-1true assume true; 23#L541-2true assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 8#L541-1true [2024-11-10 22:45:03,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash 72495338, now seen corresponding path program 1 times [2024-11-10 22:45:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171074398] [2024-11-10 22:45:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2176, now seen corresponding path program 1 times [2024-11-10 22:45:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77629137] [2024-11-10 22:45:04,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:04,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 948544297, now seen corresponding path program 1 times [2024-11-10 22:45:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:04,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449611762] [2024-11-10 22:45:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:04,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:04,555 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:04,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:04,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:04,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:04,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:04,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:04,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:04,557 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:04,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration1_Lasso [2024-11-10 22:45:04,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:04,558 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:04,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:04,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:05,228 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:05,232 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:05,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-10 22:45:05,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:05,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:05,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:05,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:05,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:05,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:05,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-10 22:45:05,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:05,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:05,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:05,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:05,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-10 22:45:05,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:05,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:05,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:05,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:05,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:05,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:05,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-10 22:45:05,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:05,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:05,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:05,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:05,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:05,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-10 22:45:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-10 22:45:05,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 [2024-11-10 22:45:05,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:05,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:05,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:05,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:05,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:45:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-10 22:45:05,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 [2024-11-10 22:45:05,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:05,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:05,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:05,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:05,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:05,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:05,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:05,506 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2024-11-10 22:45:05,506 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-10 22:45:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:05,524 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:05,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-10 22:45:05,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:05,538 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-10 22:45:05,538 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:05,539 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~nondetString1~0#1.offset >= 0] [2024-11-10 22:45:05,553 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 [2024-11-10 22:45:05,571 INFO L156 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2024-11-10 22:45:05,584 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:05,585 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:05,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:45:05,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:05,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 22:45:05,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:05,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:45:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:05,786 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 [2024-11-10 22:45:05,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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) 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) [2024-11-10 22:45:05,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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). 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 41 states and 61 transitions. Complement of second has 6 states. [2024-11-10 22:45:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:05,842 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) [2024-11-10 22:45:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2024-11-10 22:45:05,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-10 22:45:05,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 7 letters. Loop has 2 letters. [2024-11-10 22:45:05,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 5 letters. Loop has 4 letters. [2024-11-10 22:45:05,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:05,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 61 transitions. [2024-11-10 22:45:05,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 22:45:05,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 20 states and 29 transitions. [2024-11-10 22:45:05,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:45:05,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:45:05,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2024-11-10 22:45:05,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:05,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-10 22:45:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2024-11-10 22:45:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-10 22:45:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2024-11-10 22:45:05,877 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-10 22:45:05,877 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2024-11-10 22:45:05,878 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:45:05,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2024-11-10 22:45:05,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-10 22:45:05,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:05,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:05,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:05,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:45:05,881 INFO L745 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 146#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 155#L532 assume !(main_~length1~0#1 < 1); 147#L535 assume !(main_~length2~0#1 < 1); 148#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 149#L541-1 assume true; 151#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 160#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 144#L547-1 [2024-11-10 22:45:05,881 INFO L747 eck$LassoCheckResult]: Loop: 144#L547-1 assume true; 143#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 144#L547-1 [2024-11-10 22:45:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash -659897894, now seen corresponding path program 1 times [2024-11-10 22:45:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211497541] [2024-11-10 22:45:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2024-11-10 22:45:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60404389] [2024-11-10 22:45:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1493284665, now seen corresponding path program 1 times [2024-11-10 22:45:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714961813] [2024-11-10 22:45:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:05,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:06,207 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:06,207 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:06,207 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:06,207 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:06,207 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:06,207 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,207 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:06,207 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:06,207 INFO L132 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration2_Lasso [2024-11-10 22:45:06,207 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:06,207 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:06,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:06,650 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:06,650 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:06,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 22:45:06,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,672 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-10 22:45:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,692 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 22:45:06,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,725 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 [2024-11-10 22:45:06,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 22:45:06,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 [2024-11-10 22:45:06,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,763 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-10 22:45:06,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-10 22:45:06,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-10 22:45:06,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,815 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,829 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 [2024-11-10 22:45:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-10 22:45:06,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-10 22:45:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,869 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-10 22:45:06,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,886 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,901 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 [2024-11-10 22:45:06,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,903 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-10 22:45:06,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:06,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,944 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-10 22:45:06,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:06,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:06,963 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:06,977 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 [2024-11-10 22:45:06,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:06,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:06,979 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:06,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-10 22:45:06,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:06,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:06,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:06,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:06,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:06,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:06,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:06,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:06,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,004 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 [2024-11-10 22:45:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,006 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-10 22:45:07,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,026 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-10 22:45:07,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,041 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-10 22:45:07,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:07,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:07,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:07,055 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,070 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 [2024-11-10 22:45:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,072 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-10 22:45:07,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:07,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:07,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:07,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-10 22:45:07,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,107 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:45:07,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 [2024-11-10 22:45:07,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:07,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:07,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:07,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-10 22:45:07,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,133 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 22:45:07,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,150 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,167 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 22:45:07,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-10 22:45:07,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,203 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 22:45:07,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 [2024-11-10 22:45:07,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,239 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 22:45:07,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,263 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,279 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:45:07,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:07,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:07,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:07,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:07,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,314 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 22:45:07,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:07,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:07,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:07,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:07,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:07,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:07,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:07,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:07,374 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-10 22:45:07,375 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-10 22:45:07,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:07,377 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:07,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-10 22:45:07,379 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:07,397 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:07,398 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:07,398 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length2~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~length2~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-10 22:45:07,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,428 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-10 22:45:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:07,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:45:07,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:07,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:07,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:45:07,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:07,510 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 [2024-11-10 22:45:07,511 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 44 transitions. Complement of second has 6 states. [2024-11-10 22:45:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-10 22:45:07,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-10 22:45:07,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:07,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-10 22:45:07,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:07,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-10 22:45:07,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:07,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2024-11-10 22:45:07,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:07,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 31 transitions. [2024-11-10 22:45:07,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-10 22:45:07,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:45:07,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-10 22:45:07,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:07,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-10 22:45:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-10 22:45:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 22:45:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-11-10 22:45:07,531 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-10 22:45:07,532 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-10 22:45:07,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:45:07,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-11-10 22:45:07,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:07,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:07,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:07,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:07,534 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:45:07,535 INFO L745 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 266#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 282#L532 assume !(main_~length1~0#1 < 1); 272#L535 assume !(main_~length2~0#1 < 1); 273#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 274#L541-1 assume true; 276#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 286#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 285#L547-1 assume true; 267#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 268#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 271#L517 [2024-11-10 22:45:07,535 INFO L747 eck$LassoCheckResult]: Loop: 271#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 278#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 279#L520 assume !true; 281#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 284#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 271#L517 [2024-11-10 22:45:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash -952815677, now seen corresponding path program 1 times [2024-11-10 22:45:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346511648] [2024-11-10 22:45:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2024-11-10 22:45:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791462148] [2024-11-10 22:45:07,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791462148] [2024-11-10 22:45:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791462148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:45:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542679909] [2024-11-10 22:45:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:07,645 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:45:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:45:07,648 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 12 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) [2024-11-10 22:45:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:07,652 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2024-11-10 22:45:07,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-11-10 22:45:07,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:07,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-11-10 22:45:07,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:45:07,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:45:07,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-10 22:45:07,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:07,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:45:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-10 22:45:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 22:45:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-10 22:45:07,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:45:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:45:07,661 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-10 22:45:07,661 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:45:07,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2024-11-10 22:45:07,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:07,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:07,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:07,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:07,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:07,662 INFO L745 eck$LassoCheckResult]: Stem: 314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 315#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 329#L532 assume !(main_~length1~0#1 < 1); 321#L535 assume !(main_~length2~0#1 < 1); 322#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 323#L541-1 assume true; 325#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 334#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 333#L547-1 assume true; 316#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 317#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 320#L517 [2024-11-10 22:45:07,663 INFO L747 eck$LassoCheckResult]: Loop: 320#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 327#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 328#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 330#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 331#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 335#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 332#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 320#L517 [2024-11-10 22:45:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -952815677, now seen corresponding path program 2 times [2024-11-10 22:45:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139213059] [2024-11-10 22:45:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2051321746, now seen corresponding path program 1 times [2024-11-10 22:45:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501624204] [2024-11-10 22:45:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:07,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 952582764, now seen corresponding path program 1 times [2024-11-10 22:45:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249713076] [2024-11-10 22:45:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249713076] [2024-11-10 22:45:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249713076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:08,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:08,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 22:45:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498335953] [2024-11-10 22:45:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:08,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:45:08,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:45:08,283 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:08,329 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-11-10 22:45:08,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. [2024-11-10 22:45:08,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:08,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 30 transitions. [2024-11-10 22:45:08,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:45:08,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:45:08,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-10 22:45:08,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:08,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-10 22:45:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-10 22:45:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-10 22:45:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-11-10 22:45:08,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-10 22:45:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 22:45:08,334 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-10 22:45:08,334 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:45:08,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2024-11-10 22:45:08,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:08,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:08,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:08,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:08,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:08,335 INFO L745 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 388#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 398#L532 assume !(main_~length1~0#1 < 1); 389#L535 assume !(main_~length2~0#1 < 1); 390#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 391#L541-1 assume true; 392#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 393#L541-1 assume true; 394#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 402#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 401#L547-1 assume true; 382#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 383#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 386#L517 [2024-11-10 22:45:08,335 INFO L747 eck$LassoCheckResult]: Loop: 386#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 395#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 396#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 397#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 399#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 403#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 400#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 386#L517 [2024-11-10 22:45:08,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1094170306, now seen corresponding path program 1 times [2024-11-10 22:45:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915227858] [2024-11-10 22:45:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2051321746, now seen corresponding path program 2 times [2024-11-10 22:45:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594724425] [2024-11-10 22:45:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:08,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash 793620109, now seen corresponding path program 1 times [2024-11-10 22:45:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354792130] [2024-11-10 22:45:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354792130] [2024-11-10 22:45:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354792130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 22:45:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103771808] [2024-11-10 22:45:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 22:45:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 22:45:08,820 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:08,907 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-11-10 22:45:08,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2024-11-10 22:45:08,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-10 22:45:08,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 45 transitions. [2024-11-10 22:45:08,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-10 22:45:08,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-10 22:45:08,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2024-11-10 22:45:08,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:08,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-10 22:45:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2024-11-10 22:45:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-10 22:45:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 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) [2024-11-10 22:45:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-10 22:45:08,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-10 22:45:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 22:45:08,916 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-10 22:45:08,916 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:08,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2024-11-10 22:45:08,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2024-11-10 22:45:08,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:08,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:08,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:08,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:08,919 INFO L745 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 460#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 476#L532 assume !(main_~length1~0#1 < 1); 467#L535 assume !(main_~length2~0#1 < 1); 468#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 469#L541-1 assume true; 470#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 471#L541-1 assume true; 472#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 482#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 480#L547-1 assume true; 461#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 462#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 485#L517 [2024-11-10 22:45:08,919 INFO L747 eck$LassoCheckResult]: Loop: 485#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 486#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 488#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 477#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 478#L520-1 assume !!substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;substring_#t~post7#1.base, substring_#t~post7#1.offset := substring_~pt~0#1.base, substring_~pt~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_#t~post7#1.base, 1 + substring_#t~post7#1.offset;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset;substring_#t~post8#1.base, substring_#t~post8#1.offset := substring_~ps2~0#1.base, substring_~ps2~0#1.offset;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_#t~post8#1.base, 1 + substring_#t~post8#1.offset;havoc substring_#t~post8#1.base, substring_#t~post8#1.offset; 483#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 492#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 491#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 490#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 489#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 485#L517 [2024-11-10 22:45:08,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1094170306, now seen corresponding path program 2 times [2024-11-10 22:45:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779101239] [2024-11-10 22:45:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2067533059, now seen corresponding path program 1 times [2024-11-10 22:45:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555836535] [2024-11-10 22:45:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:08,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:08,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -994382722, now seen corresponding path program 1 times [2024-11-10 22:45:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909616928] [2024-11-10 22:45:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909616928] [2024-11-10 22:45:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909616928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:45:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754592793] [2024-11-10 22:45:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:45:09,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:09,255 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:45:09,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-10 22:45:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 22:45:09,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:09,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 11 treesize of output 7 [2024-11-10 22:45:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 22:45:09,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 22:45:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754592793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 22:45:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-10 22:45:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685250868] [2024-11-10 22:45:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:09,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 22:45:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-10 22:45:09,784 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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) [2024-11-10 22:45:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:09,869 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-10 22:45:09,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 59 transitions. [2024-11-10 22:45:09,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-10 22:45:09,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 50 transitions. [2024-11-10 22:45:09,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-10 22:45:09,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-10 22:45:09,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2024-11-10 22:45:09,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:09,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-10 22:45:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2024-11-10 22:45:09,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-10 22:45:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-10 22:45:09,879 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-10 22:45:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 22:45:09,880 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-10 22:45:09,881 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:09,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2024-11-10 22:45:09,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-10 22:45:09,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:09,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:09,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:09,885 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:09,886 INFO L745 eck$LassoCheckResult]: Stem: 635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 636#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 652#L532 assume !(main_~length1~0#1 < 1); 643#L535 assume main_~length2~0#1 < 1;main_~length2~0#1 := 1; 644#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 646#L541-1 assume true; 647#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 648#L541-1 assume true; 649#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 660#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 661#L547-1 assume true; 639#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 640#L547-1 assume true; 637#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 638#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 667#L517 [2024-11-10 22:45:09,886 INFO L747 eck$LassoCheckResult]: Loop: 667#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 650#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 651#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 655#L520-2 assume !substring_#t~short6#1; 656#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 662#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 668#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 667#L517 [2024-11-10 22:45:09,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:09,886 INFO L85 PathProgramCache]: Analyzing trace with hash -898340892, now seen corresponding path program 1 times [2024-11-10 22:45:09,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:09,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303925642] [2024-11-10 22:45:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:09,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303925642] [2024-11-10 22:45:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303925642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:09,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:09,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:45:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640307677] [2024-11-10 22:45:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:09,936 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:45:09,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2051291955, now seen corresponding path program 1 times [2024-11-10 22:45:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976032904] [2024-11-10 22:45:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976032904] [2024-11-10 22:45:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976032904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 22:45:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703372495] [2024-11-10 22:45:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:09,974 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:09,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 22:45:09,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 22:45:09,975 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2024-11-10 22:45:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:09,998 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-10 22:45:09,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-11-10 22:45:09,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:10,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 22 states and 26 transitions. [2024-11-10 22:45:10,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-10 22:45:10,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-10 22:45:10,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2024-11-10 22:45:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:10,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-10 22:45:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2024-11-10 22:45:10,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-10 22:45:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-10 22:45:10,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-10 22:45:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 22:45:10,004 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-10 22:45:10,005 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:45:10,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-11-10 22:45:10,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 22:45:10,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:10,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:10,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:10,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:10,007 INFO L745 eck$LassoCheckResult]: Stem: 734#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 735#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 745#L532 assume !(main_~length1~0#1 < 1); 736#L535 assume !(main_~length2~0#1 < 1); 737#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 738#L541-1 assume true; 739#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 740#L541-1 assume true; 741#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 749#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 748#L547-1 assume true; 731#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 732#L547-1 assume true; 729#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 730#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 733#L517 [2024-11-10 22:45:10,007 INFO L747 eck$LassoCheckResult]: Loop: 733#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 742#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 743#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 744#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 746#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 750#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 747#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 733#L517 [2024-11-10 22:45:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -769258173, now seen corresponding path program 1 times [2024-11-10 22:45:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843835032] [2024-11-10 22:45:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:10,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2051321746, now seen corresponding path program 3 times [2024-11-10 22:45:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954875851] [2024-11-10 22:45:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:10,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1412052204, now seen corresponding path program 1 times [2024-11-10 22:45:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090229768] [2024-11-10 22:45:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:10,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:10,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:10,747 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:10,748 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:10,748 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:10,748 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:10,748 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:10,748 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:10,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:10,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:10,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration8_Lasso [2024-11-10 22:45:10,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:10,749 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:10,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:10,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:11,554 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:11,554 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:11,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,556 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-10 22:45:11,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,588 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 [2024-11-10 22:45:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,591 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-10 22:45:11,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,622 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 [2024-11-10 22:45:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,624 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-10 22:45:11,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,644 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,660 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-10 22:45:11,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-10 22:45:11,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,693 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-10 22:45:11,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,729 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-10 22:45:11,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,759 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 [2024-11-10 22:45:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,761 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-10 22:45:11,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 [2024-11-10 22:45:11,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,786 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-10 22:45:11,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-10 22:45:11,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,811 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-10 22:45:11,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-10 22:45:11,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,840 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-10 22:45:11,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,867 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-10 22:45:11,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,900 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-10 22:45:11,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:11,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,928 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-10 22:45:11,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:11,941 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-10 22:45:11,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,952 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-10 22:45:11,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:11,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:11,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:11,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-10 22:45:11,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:11,987 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-10 22:45:11,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:11,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:11,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:11,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:11,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:12,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-10 22:45:12,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,011 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-10 22:45:12,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:12,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:12,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:12,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-10 22:45:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,036 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-10 22:45:12,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 [2024-11-10 22:45:12,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:12,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:12,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:12,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,065 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 [2024-11-10 22:45:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,066 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-10 22:45:12,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:12,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:12,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:12,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-10 22:45:12,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,090 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-10 22:45:12,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:12,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:12,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:12,103 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:12,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,115 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-10 22:45:12,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,128 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-11-10 22:45:12,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,197 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2024-11-10 22:45:12,197 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2024-11-10 22:45:12,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,328 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-10 22:45:12,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,365 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 [2024-11-10 22:45:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,375 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-10 22:45:12,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,407 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-10 22:45:12,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-10 22:45:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,436 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-10 22:45:12,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-10 22:45:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,468 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-10 22:45:12,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-10 22:45:12,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,500 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-10 22:45:12,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,522 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:12,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,538 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-10 22:45:12,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:12,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:12,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,579 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-10 22:45:12,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:12,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:12,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:12,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:12,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:12,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:12,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:12,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:12,634 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-11-10 22:45:12,634 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-10 22:45:12,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:12,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:12,636 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:12,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-10 22:45:12,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:12,652 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:12,653 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:12,653 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_3) = -1*ULTIMATE.start_substring_~ps~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_3 Supporting invariants [] [2024-11-10 22:45:12,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-11-10 22:45:12,694 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2024-11-10 22:45:12,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:12,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:12,696 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ps~0!offset [2024-11-10 22:45:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:12,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:45:12,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:12,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:45:12,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:12,855 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-10 22:45:12,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:12,907 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 35 transitions. Complement of second has 5 states. [2024-11-10 22:45:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2024-11-10 22:45:12,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-10 22:45:12,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:12,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 22 letters. Loop has 7 letters. [2024-11-10 22:45:12,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:12,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 14 letters. [2024-11-10 22:45:12,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:12,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2024-11-10 22:45:12,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:12,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 33 transitions. [2024-11-10 22:45:12,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-10 22:45:12,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-10 22:45:12,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2024-11-10 22:45:12,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:12,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-10 22:45:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2024-11-10 22:45:12,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-10 22:45:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-10 22:45:12,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-10 22:45:12,914 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-10 22:45:12,914 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:45:12,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2024-11-10 22:45:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:12,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:12,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:12,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:12,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:45:12,915 INFO L745 eck$LassoCheckResult]: Stem: 930#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 931#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 944#L532 assume !(main_~length1~0#1 < 1); 932#L535 assume !(main_~length2~0#1 < 1); 933#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 934#L541-1 assume true; 935#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 936#L541-1 assume true; 937#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 950#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 949#L547-1 assume true; 927#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 928#L547-1 assume true; 925#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 926#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 929#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 938#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 939#L520 [2024-11-10 22:45:12,915 INFO L747 eck$LassoCheckResult]: Loop: 939#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 942#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 945#L520-1 assume !!substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;substring_#t~post7#1.base, substring_#t~post7#1.offset := substring_~pt~0#1.base, substring_~pt~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_#t~post7#1.base, 1 + substring_#t~post7#1.offset;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset;substring_#t~post8#1.base, substring_#t~post8#1.offset := substring_~ps2~0#1.base, substring_~ps2~0#1.offset;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_#t~post8#1.base, 1 + substring_#t~post8#1.offset;havoc substring_#t~post8#1.base, substring_#t~post8#1.offset; 939#L520 [2024-11-10 22:45:12,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash -522728574, now seen corresponding path program 1 times [2024-11-10 22:45:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577595922] [2024-11-10 22:45:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2024-11-10 22:45:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:12,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301426781] [2024-11-10 22:45:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:12,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 944485071, now seen corresponding path program 1 times [2024-11-10 22:45:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:12,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917701287] [2024-11-10 22:45:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:12,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:13,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-10 22:45:13,992 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:13,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:13,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:13,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:13,992 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:13,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:13,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:13,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:13,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration9_Lasso [2024-11-10 22:45:13,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:13,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:13,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:13,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:13,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:14,880 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:14,880 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:14,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:14,886 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:14,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-10 22:45:14,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:14,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:14,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:14,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:14,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:14,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:14,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:14,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:14,905 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:14,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:14,921 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:14,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2024-11-10 22:45:14,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:14,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:14,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:14,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:14,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:14,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:14,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:14,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:14,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:14,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-10 22:45:14,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:14,954 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:14,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2024-11-10 22:45:14,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:14,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:14,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:14,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:14,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:14,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:14,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:14,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:14,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:14,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:14,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:14,989 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:14,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2024-11-10 22:45:14,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 [2024-11-10 22:45:15,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:15,001 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-10 22:45:15,001 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:45:15,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:15,009 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-11-10 22:45:15,009 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-10 22:45:15,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:15,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-10 22:45:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:15,036 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:15,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2024-11-10 22:45:15,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 [2024-11-10 22:45:15,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:15,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:15,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:15,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:15,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:15,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:15,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:15,070 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-10 22:45:15,070 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-10 22:45:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:15,073 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:15,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2024-11-10 22:45:15,074 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:15,087 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:15,088 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:15,088 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~pt~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc14#1.base)_4) = -1*ULTIMATE.start_substring_~pt~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14#1.base)_4 Supporting invariants [] [2024-11-10 22:45:15,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:15,145 INFO L156 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2024-11-10 22:45:15,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pt~0!offset [2024-11-10 22:45:15,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:15,146 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:15,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:15,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 22:45:15,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:15,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:45:15,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:15,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-10 22:45:15,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:15,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 10. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 50 transitions. Complement of second has 7 states. [2024-11-10 22:45:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2024-11-10 22:45:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-10 22:45:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2024-11-10 22:45:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 17 letters. Loop has 6 letters. [2024-11-10 22:45:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:15,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2024-11-10 22:45:15,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:15,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 40 transitions. [2024-11-10 22:45:15,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-10 22:45:15,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-10 22:45:15,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2024-11-10 22:45:15,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:15,344 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-10 22:45:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2024-11-10 22:45:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-10 22:45:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 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) [2024-11-10 22:45:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-10 22:45:15,351 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 22:45:15,351 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-10 22:45:15,351 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:45:15,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2024-11-10 22:45:15,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:15,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:15,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:15,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:15,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:45:15,352 INFO L745 eck$LassoCheckResult]: Stem: 1149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1150#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1166#L532 assume !(main_~length1~0#1 < 1); 1156#L535 assume !(main_~length2~0#1 < 1); 1157#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 1158#L541-1 assume true; 1159#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1160#L541-1 assume true; 1161#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1176#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 1175#L547-1 assume true; 1153#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1154#L547-1 assume true; 1151#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1152#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 1155#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 1164#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 1165#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 1181#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 1179#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 1177#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 1173#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 1174#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 1162#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 1163#L520 [2024-11-10 22:45:15,352 INFO L747 eck$LassoCheckResult]: Loop: 1163#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 1167#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 1170#L520-1 assume !!substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;substring_#t~post7#1.base, substring_#t~post7#1.offset := substring_~pt~0#1.base, substring_~pt~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_#t~post7#1.base, 1 + substring_#t~post7#1.offset;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset;substring_#t~post8#1.base, substring_#t~post8#1.offset := substring_~ps2~0#1.base, substring_~ps2~0#1.offset;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_#t~post8#1.base, 1 + substring_#t~post8#1.offset;havoc substring_#t~post8#1.base, substring_#t~post8#1.offset; 1163#L520 [2024-11-10 22:45:15,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash -227496725, now seen corresponding path program 2 times [2024-11-10 22:45:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960032342] [2024-11-10 22:45:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960032342] [2024-11-10 22:45:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960032342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:45:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022662074] [2024-11-10 22:45:15,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:45:15,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:45:15,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:15,632 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:45:15,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-10 22:45:15,718 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:45:15,718 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:45:15,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 22:45:15,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:15,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 22:45:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:15,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:45:15,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-10 22:45:15,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 22:45:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 22:45:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022662074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:45:15,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:45:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 22:45:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315996462] [2024-11-10 22:45:15,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:45:15,881 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:45:15,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2024-11-10 22:45:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120069333] [2024-11-10 22:45:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:15,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2024-11-10 22:45:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:15,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:15,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 22:45:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 22:45:16,015 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 11 Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:16,104 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-10 22:45:16,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2024-11-10 22:45:16,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:16,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 36 states and 42 transitions. [2024-11-10 22:45:16,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-10 22:45:16,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-10 22:45:16,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2024-11-10 22:45:16,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:45:16,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-10 22:45:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2024-11-10 22:45:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-10 22:45:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-10 22:45:16,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-10 22:45:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 22:45:16,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-10 22:45:16,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 22:45:16,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2024-11-10 22:45:16,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-10 22:45:16,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:16,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:16,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:16,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-10 22:45:16,111 INFO L745 eck$LassoCheckResult]: Stem: 1402#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1403#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~nondet15#1, main_#t~post16#1, main_~i~0#1, main_#t~nondet17#1, main_#t~post18#1, main_~i~1#1, main_#t~ret19#1, 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~nondet11#1;main_~length1~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~length2~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1416#L532 assume !(main_~length1~0#1 < 1); 1404#L535 assume !(main_~length2~0#1 < 1); 1405#L538 call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 4294967296);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 4294967296);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc14#1.base, main_#t~malloc14#1.offset;main_~i~0#1 := 0; 1406#L541-1 assume true; 1407#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1408#L541-1 assume true; 1409#L541-2 assume !!(main_~i~0#1 < main_~length1~0#1 - 1);havoc main_#t~nondet15#1;call write~int#1(main_#t~nondet15#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet15#1;main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; 1429#L541-1 assume true; 1428#L541-2 assume !(main_~i~0#1 < main_~length1~0#1 - 1); 1423#L541 havoc main_~i~0#1;main_~i~1#1 := 0; 1422#L547-1 assume true; 1399#L547-2 assume !!(main_~i~1#1 < main_~length2~0#1 - 1);havoc main_#t~nondet17#1;call write~int#0(main_#t~nondet17#1, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet17#1;main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1400#L547-1 assume true; 1397#L547-2 assume !(main_~i~1#1 < main_~length2~0#1 - 1); 1398#L547 havoc main_~i~1#1;call write~int#1(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#0(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_substring } true;substring_#in~s#1.base, substring_#in~s#1.offset, substring_#in~t#1.base, substring_#in~t#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc substring_#res#1;havoc substring_#t~mem2#1, substring_#t~mem3#1, substring_#t~mem4#1, substring_#t~mem5#1, substring_#t~short6#1, substring_#t~post7#1.base, substring_#t~post7#1.offset, substring_#t~post8#1.base, substring_#t~post8#1.offset, substring_#t~mem9#1, substring_#t~post10#1.base, substring_#t~post10#1.offset, substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset, substring_~s#1.base, substring_~s#1.offset, substring_~t#1.base, substring_~t#1.offset, substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~s#1.base, substring_~s#1.offset := substring_#in~s#1.base, substring_#in~s#1.offset;substring_~t#1.base, substring_~t#1.offset := substring_#in~t#1.base, substring_#in~t#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_~s#1.base, substring_~s#1.offset; 1401#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 1427#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 1425#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 1418#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 1419#L520-1 assume !substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1; 1426#L524-2 call substring_#t~mem9#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1); 1420#L524-1 assume !(0 == substring_#t~mem9#1);havoc substring_#t~mem9#1;substring_#t~post10#1.base, substring_#t~post10#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~ps~0#1.base, substring_~ps~0#1.offset := substring_#t~post10#1.base, 1 + substring_#t~post10#1.offset;havoc substring_~ps2~0#1.base, substring_~ps2~0#1.offset, substring_~pt~0#1.base, substring_~pt~0#1.offset;havoc substring_#t~post10#1.base, substring_#t~post10#1.offset; 1421#L517 assume true;call substring_#t~mem2#1 := read~int#1(substring_~ps~0#1.base, substring_~ps~0#1.offset, 1); 1410#L517-1 assume !!(0 != substring_#t~mem2#1);havoc substring_#t~mem2#1;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_~ps~0#1.base, substring_~ps~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_~t#1.base, substring_~t#1.offset; 1411#L520 [2024-11-10 22:45:16,111 INFO L747 eck$LassoCheckResult]: Loop: 1411#L520 assume true;call substring_#t~mem3#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);substring_#t~short6#1 := 0 != substring_#t~mem3#1; 1414#L520-2 assume substring_#t~short6#1;call substring_#t~mem4#1 := read~int#0(substring_~pt~0#1.base, substring_~pt~0#1.offset, 1);call substring_#t~mem5#1 := read~int#1(substring_~ps2~0#1.base, substring_~ps2~0#1.offset, 1);substring_#t~short6#1 := substring_#t~mem4#1 == substring_#t~mem5#1; 1417#L520-1 assume !!substring_#t~short6#1;havoc substring_#t~mem3#1;havoc substring_#t~mem4#1;havoc substring_#t~mem5#1;havoc substring_#t~short6#1;substring_#t~post7#1.base, substring_#t~post7#1.offset := substring_~pt~0#1.base, substring_~pt~0#1.offset;substring_~pt~0#1.base, substring_~pt~0#1.offset := substring_#t~post7#1.base, 1 + substring_#t~post7#1.offset;havoc substring_#t~post7#1.base, substring_#t~post7#1.offset;substring_#t~post8#1.base, substring_#t~post8#1.offset := substring_~ps2~0#1.base, substring_~ps2~0#1.offset;substring_~ps2~0#1.base, substring_~ps2~0#1.offset := substring_#t~post8#1.base, 1 + substring_#t~post8#1.offset;havoc substring_#t~post8#1.base, substring_#t~post8#1.offset; 1411#L520 [2024-11-10 22:45:16,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1596177484, now seen corresponding path program 3 times [2024-11-10 22:45:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216829471] [2024-11-10 22:45:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:16,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2024-11-10 22:45:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989602441] [2024-11-10 22:45:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:16,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2140509637, now seen corresponding path program 1 times [2024-11-10 22:45:16,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:16,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919593465] [2024-11-10 22:45:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:16,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:17,955 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:45:17,955 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:45:17,955 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:45:17,955 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:45:17,955 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:45:17,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:17,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:45:17,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:45:17,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: substring-alloca-2.i_Iteration11_Lasso [2024-11-10 22:45:17,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:45:17,955 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:45:17,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:17,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:18,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:45:19,189 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:45:19,189 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:45:19,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,191 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2024-11-10 22:45:19,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-10 22:45:19,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,216 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-10 22:45:19,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-10 22:45:19,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,258 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-10 22:45:19,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,282 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-10 22:45:19,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2024-11-10 22:45:19,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,310 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-10 22:45:19,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,323 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:19,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,335 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-10 22:45:19,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2024-11-10 22:45:19,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,358 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-10 22:45:19,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:19,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,382 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-10 22:45:19,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-10 22:45:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,406 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-10 22:45:19,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:19,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,431 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-10 22:45:19,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:19,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:19,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2024-11-10 22:45:19,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,459 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-10 22:45:19,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 [2024-11-10 22:45:19,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:45:19,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:45:19,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:45:19,471 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-10 22:45:19,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,483 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-10 22:45:19,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:19,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:19,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-10 22:45:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,508 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-10 22:45:19,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:45:19,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,520 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2024-11-10 22:45:19,520 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-10 22:45:19,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,554 INFO L401 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2024-11-10 22:45:19,554 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-10 22:45:19,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:45:19,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-10 22:45:19,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,632 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2024-11-10 22:45:19,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 [2024-11-10 22:45:19,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:45:19,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:45:19,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:45:19,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:45:19,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:45:19,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:45:19,656 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:45:19,670 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-10 22:45:19,670 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-10 22:45:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:19,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:19,672 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 22:45:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2024-11-10 22:45:19,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:45:19,684 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:45:19,684 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:45:19,684 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps2~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5) = -1*ULTIMATE.start_substring_~ps2~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13#1.base)_5 Supporting invariants [] [2024-11-10 22:45:19,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:19,732 INFO L156 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2024-11-10 22:45:19,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:45:19,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:45:19,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ps2~0!offset [2024-11-10 22:45:19,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:19,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:45:19,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:19,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:45:19,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:19,911 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-10 22:45:19,911 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:19,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 49 transitions. Complement of second has 9 states. [2024-11-10 22:45:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-11-10 22:45:19,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 26 letters. Loop has 3 letters. [2024-11-10 22:45:19,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:19,955 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:19,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:20,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:45:20,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:20,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:45:20,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:20,104 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-10 22:45:20,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:20,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 49 transitions. Complement of second has 9 states. [2024-11-10 22:45:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2024-11-10 22:45:20,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 26 letters. Loop has 3 letters. [2024-11-10 22:45:20,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:20,149 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-10 22:45:20,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:20,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 22:45:20,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:20,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 22:45:20,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:45:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:45:20,322 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2024-11-10 22:45:20,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:20,361 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 41 transitions. cyclomatic complexity: 11. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 54 transitions. Complement of second has 8 states. [2024-11-10 22:45:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:45:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:45:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2024-11-10 22:45:20,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 26 letters. Loop has 3 letters. [2024-11-10 22:45:20,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:20,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 29 letters. Loop has 3 letters. [2024-11-10 22:45:20,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:20,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 26 letters. Loop has 6 letters. [2024-11-10 22:45:20,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:45:20,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-10 22:45:20,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:45:20,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2024-11-10 22:45:20,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-10 22:45:20,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-10 22:45:20,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-10 22:45:20,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:20,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:20,365 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:20,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 22:45:20,366 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-10 22:45:20,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-10 22:45:20,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-10 22:45:20,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-10 22:45:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:20 BoogieIcfgContainer [2024-11-10 22:45:20,373 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:20,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:20,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:20,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:20,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:03" (3/4) ... [2024-11-10 22:45:20,376 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 22:45:20,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:20,377 INFO L158 Benchmark]: Toolchain (without parser) took 17542.70ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 114.8MB in the beginning and 104.0MB in the end (delta: 10.8MB). Peak memory consumption was 167.6MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,377 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:20,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.17ms. Allocated memory is still 176.2MB. Free memory was 114.8MB in the beginning and 95.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.43ms. Allocated memory is still 176.2MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,378 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,378 INFO L158 Benchmark]: IcfgBuilder took 396.23ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 76.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,379 INFO L158 Benchmark]: BuchiAutomizer took 16621.56ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 76.6MB in the beginning and 105.0MB in the end (delta: -28.4MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2024-11-10 22:45:20,379 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 331.4MB. Free memory was 105.0MB in the beginning and 104.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:20,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.13ms. Allocated memory is still 176.2MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.17ms. Allocated memory is still 176.2MB. Free memory was 114.8MB in the beginning and 95.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.43ms. Allocated memory is still 176.2MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 396.23ms. Allocated memory is still 176.2MB. Free memory was 91.8MB in the beginning and 76.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 16621.56ms. Allocated memory was 176.2MB in the beginning and 331.4MB in the end (delta: 155.2MB). Free memory was 76.6MB in the beginning and 105.0MB in the end (delta: -28.4MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 331.4MB. Free memory was 105.0MB in the beginning and 104.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ps~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pt~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ps2~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function (length2 + ((long long) -1 * i)) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.5s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 14.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 206 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital185 mio100 ax110 hnf100 lsp88 ukn80 mio100 lsp33 div132 bol100 ite100 ukn100 eq163 hnf92 smp88 dnf288 smp87 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 202ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-10 22:45:20,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:20,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2024-11-10 22:45:20,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-11-10 22:45:21,005 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