./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d 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/termination-crafted-lit/cstrcspn.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:02:53,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:02:53,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:02:53,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:02:53,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:02:53,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:02:53,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:02:53,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:02:53,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:02:53,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:02:53,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:02:53,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:02:53,616 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:02:53,616 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:02:53,617 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:02:53,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:02:53,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:02:53,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:02:53,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:02:53,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:02:53,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:02:53,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:02:53,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:02:53,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:02:53,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:02:53,620 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:02:53,620 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 [2024-11-17 08:02:53,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:02:53,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:02:53,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:02:53,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:02:53,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:02:53,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2024-11-17 08:02:55,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:02:55,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:02:55,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2024-11-17 08:02:55,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d087646cd/b8246aee1394471085512de2e041b187/FLAG8c71bd937 [2024-11-17 08:02:55,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d087646cd/b8246aee1394471085512de2e041b187 [2024-11-17 08:02:55,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:02:55,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:02:55,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:02:55,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:02:55,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:02:55,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768d8bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55, skipping insertion in model container [2024-11-17 08:02:55,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:02:55,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:02:55,461 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:02:55,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:02:55,490 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:02:55,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55 WrapperNode [2024-11-17 08:02:55,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:02:55,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:02:55,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:02:55,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:02:55,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,517 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2024-11-17 08:02:55,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:02:55,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:02:55,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:02:55,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:02:55,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,537 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-17 08:02:55,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:02:55,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:02:55,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:02:55,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:02:55,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (1/1) ... [2024-11-17 08:02:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:55,572 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-17 08:02:55,574 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-17 08:02:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:02:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 08:02:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:02:55,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:02:55,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:02:55,662 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:02:55,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:02:55,782 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret12#1; [2024-11-17 08:02:55,793 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-17 08:02:55,793 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:02:55,805 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:02:55,805 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:02:55,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:02:55 BoogieIcfgContainer [2024-11-17 08:02:55,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:02:55,807 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:02:55,807 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:02:55,810 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:02:55,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:02:55,810 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:02:55" (1/3) ... [2024-11-17 08:02:55,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a9831a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:02:55, skipping insertion in model container [2024-11-17 08:02:55,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:02:55,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:02:55" (2/3) ... [2024-11-17 08:02:55,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23a9831a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:02:55, skipping insertion in model container [2024-11-17 08:02:55,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:02:55,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:02:55" (3/3) ... [2024-11-17 08:02:55,812 INFO L332 chiAutomizerObserver]: Analyzing ICFG cstrcspn.c [2024-11-17 08:02:55,853 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:02:55,853 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:02:55,853 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:02:55,854 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:02:55,854 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:02:55,854 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:02:55,854 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:02:55,854 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:02:55,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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-17 08:02:55,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:02:55,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:02:55,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:02:55,874 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:02:55,874 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:02:55,874 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:02:55,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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-17 08:02:55,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:02:55,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:02:55,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:02:55,876 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:02:55,876 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:02:55,880 INFO L745 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 16#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 19#L14-1true assume !(build_nondet_String_~length~0#1 < 1); 17#L17-1true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 9#L19-1true assume true;main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 13#L14true assume !(build_nondet_String_~length~0#1 < 1); 14#L17true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 18#L19true assume true;main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 6#L30true [2024-11-17 08:02:55,881 INFO L747 eck$LassoCheckResult]: Loop: 6#L30true assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 4#L30-2true assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 10#L33true assume !true; 15#L35-1true call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 20#L35true assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset; 6#L30true [2024-11-17 08:02:55,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1170829659, now seen corresponding path program 1 times [2024-11-17 08:02:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788661624] [2024-11-17 08:02:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2024-11-17 08:02:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399133471] [2024-11-17 08:02:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:02:56,089 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-17 08:02:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:02:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399133471] [2024-11-17 08:02:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399133471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:02:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:02:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:02:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607478436] [2024-11-17 08:02:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:02:56,094 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:02:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:02:56,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 08:02:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 08:02:56,121 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:02:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:02:56,127 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2024-11-17 08:02:56,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2024-11-17 08:02:56,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:02:56,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2024-11-17 08:02:56,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-17 08:02:56,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:02:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2024-11-17 08:02:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:02:56,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:02:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2024-11-17 08:02:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-17 08:02:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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-17 08:02:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-17 08:02:56,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:02:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 08:02:56,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-17 08:02:56,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:02:56,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-17 08:02:56,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-17 08:02:56,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:02:56,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:02:56,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:02:56,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:02:56,155 INFO L745 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 61#L14-1 assume !(build_nondet_String_~length~0#1 < 1); 62#L17-1 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 55#L19-1 assume true;main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 56#L14 assume !(build_nondet_String_~length~0#1 < 1); 58#L17 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 59#L19 assume true;main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 50#L30 [2024-11-17 08:02:56,155 INFO L747 eck$LassoCheckResult]: Loop: 50#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 48#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 49#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 57#L33-2 assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 53#L33-1 assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1; 54#L35-1 call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 60#L35 assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset; 50#L30 [2024-11-17 08:02:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1170829659, now seen corresponding path program 2 times [2024-11-17 08:02:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997624423] [2024-11-17 08:02:56,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:56,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2051321746, now seen corresponding path program 1 times [2024-11-17 08:02:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605347315] [2024-11-17 08:02:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:56,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash -976583212, now seen corresponding path program 1 times [2024-11-17 08:02:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:56,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789003622] [2024-11-17 08:02:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:56,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:56,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:57,236 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:02:57,237 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:02:57,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:02:57,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:02:57,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:02:57,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:57,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:02:57,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:02:57,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration2_Lasso [2024-11-17 08:02:57,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:02:57,239 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:02:57,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:57,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:58,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:02:58,040 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:02:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,043 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-17 08:02:58,044 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-17 08:02:58,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:02:58,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:02:58,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:02:58,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:02:58,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:02:58,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,075 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-17 08:02:58,076 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-17 08:02:58,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:02:58,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:02:58,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:02:58,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:02:58,104 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-17 08:02:58,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,107 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-17 08:02:58,108 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-17 08:02:58,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:02:58,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:02:58,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:02:58,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:02:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,139 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-17 08:02:58,140 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-17 08:02:58,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:02:58,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:02:58,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:02:58,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:02:58,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:02:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,167 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-17 08:02:58,177 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-17 08:02:58,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:02:58,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:02:58,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:02:58,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:02:58,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:02:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,206 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-17 08:02:58,207 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-17 08:02:58,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:02:58,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:02:58,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:02:58,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:02:58,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:02:58,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:02:58,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:02:58,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:02:58,262 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-17 08:02:58,263 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-17 08:02:58,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:58,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:02:58,315 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-17 08:02:58,317 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-17 08:02:58,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:02:58,330 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:02:58,330 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:02:58,331 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s1#1.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s1#1.base)_1 Supporting invariants [] [2024-11-17 08:02:58,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:02:58,362 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-17 08:02:58,374 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2024-11-17 08:02:58,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:02:58,378 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:02:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:02:58,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:02:58,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:02:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:02:58,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:02:58,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:02:58,511 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-17 08:02:58,515 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:02:58,516 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:02:58,572 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 29 transitions. Complement of second has 4 states. [2024-11-17 08:02:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:02:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:02:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2024-11-17 08:02:58,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 7 letters. [2024-11-17 08:02:58,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:02:58,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-17 08:02:58,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:02:58,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 14 letters. [2024-11-17 08:02:58,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:02:58,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2024-11-17 08:02:58,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:02:58,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 27 transitions. [2024-11-17 08:02:58,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:02:58,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:02:58,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-11-17 08:02:58,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:02:58,582 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:02:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-11-17 08:02:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 08:02:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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-17 08:02:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-17 08:02:58,583 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:02:58,583 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:02:58,583 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:02:58,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-17 08:02:58,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:02:58,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:02:58,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:02:58,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:02:58,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:02:58,586 INFO L745 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 185#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 196#L14-1 assume !(build_nondet_String_~length~0#1 < 1); 197#L17-1 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 189#L19-1 assume true;main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 190#L14 assume !(build_nondet_String_~length~0#1 < 1); 193#L17 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 195#L19 assume true;main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 182#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 178#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 179#L33 [2024-11-17 08:02:58,586 INFO L747 eck$LassoCheckResult]: Loop: 179#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 191#L33-2 assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 186#L33-1 assume !!cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset; 179#L33 [2024-11-17 08:02:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -114128486, now seen corresponding path program 1 times [2024-11-17 08:02:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:58,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75126037] [2024-11-17 08:02:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:58,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:58,623 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2024-11-17 08:02:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:58,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075303841] [2024-11-17 08:02:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:58,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:02:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1612389815, now seen corresponding path program 1 times [2024-11-17 08:02:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:02:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142094088] [2024-11-17 08:02:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:02:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:02:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:02:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:02:58,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:02:59,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-17 08:02:59,372 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:02:59,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:02:59,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:02:59,372 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:02:59,372 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:02:59,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:02:59,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:02:59,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:02:59,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration3_Lasso [2024-11-17 08:02:59,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:02:59,373 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:02:59,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:02:59,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:00,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:00,037 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:03:00,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,038 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-17 08:03:00,039 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-17 08:03:00,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:00,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:00,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:00,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:00,061 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-17 08:03:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,063 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-17 08:03:00,064 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-17 08:03:00,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:00,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:00,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:00,076 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:00,086 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-17 08:03:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,088 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-17 08:03:00,088 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-17 08:03:00,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:00,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:00,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:00,114 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-17 08:03:00,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,115 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-17 08:03:00,116 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-17 08:03:00,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:00,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:00,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:00,128 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:00,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,139 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-17 08:03:00,140 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-17 08:03:00,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:00,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:00,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:00,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:03:00,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,166 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-17 08:03:00,167 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-17 08:03:00,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:00,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:00,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:00,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:00,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:00,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:00,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:00,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:03:00,196 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-17 08:03:00,196 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-17 08:03:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,198 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-17 08:03:00,199 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-17 08:03:00,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:03:00,210 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:03:00,210 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:03:00,210 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = -2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 36893488147419103229 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_1 + 18446744073709551615 >= 0] [2024-11-17 08:03:00,221 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-17 08:03:00,237 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:03:00,238 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-17 08:03:00,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:00,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 08:03:00,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:00,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 08:03:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:00,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 08:03:00,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:00,355 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-17 08:03:00,355 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-17 08:03:00,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:00,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 48 transitions. Complement of second has 7 states. [2024-11-17 08:03:00,405 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-17 08:03:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2024-11-17 08:03:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-17 08:03:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2024-11-17 08:03:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:00,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-17 08:03:00,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:00,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2024-11-17 08:03:00,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:03:00,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 27 states and 36 transitions. [2024-11-17 08:03:00,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:03:00,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:03:00,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2024-11-17 08:03:00,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:00,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-17 08:03:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2024-11-17 08:03:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-17 08:03:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-17 08:03:00,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-17 08:03:00,413 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-17 08:03:00,413 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:03:00,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2024-11-17 08:03:00,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:03:00,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:00,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:00,415 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:00,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:03:00,416 INFO L745 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 343#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 356#L14-1 assume !(build_nondet_String_~length~0#1 < 1); 357#L17-1 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 346#L19-1 assume true;main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 347#L14 assume !(build_nondet_String_~length~0#1 < 1); 352#L17 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 355#L19 assume true;main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 339#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 337#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 338#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 360#L33-2 assume !cstrcspn_#t~short6#1; 358#L33-1 assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1; 353#L35-1 call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 354#L35 assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset; 340#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 335#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 336#L33 [2024-11-17 08:03:00,416 INFO L747 eck$LassoCheckResult]: Loop: 336#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 348#L33-2 assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 344#L33-1 assume !!cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset; 336#L33 [2024-11-17 08:03:00,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2130001010, now seen corresponding path program 1 times [2024-11-17 08:03:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061950641] [2024-11-17 08:03:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:00,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:00,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2024-11-17 08:03:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391113688] [2024-11-17 08:03:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:00,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:00,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1013275615, now seen corresponding path program 1 times [2024-11-17 08:03:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902493275] [2024-11-17 08:03:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:00,532 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-17 08:03:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902493275] [2024-11-17 08:03:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902493275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:03:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725080315] [2024-11-17 08:03:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:03:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:00,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:03:00,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 08:03:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:00,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-17 08:03:00,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:00,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:03:00,881 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-17 08:03:00,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-17 08:03:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:00,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725080315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:03:00,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:03:00,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 15 [2024-11-17 08:03:00,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427769517] [2024-11-17 08:03:00,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:03:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 08:03:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-17 08:03:00,975 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 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-17 08:03:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:01,086 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-17 08:03:01,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 67 transitions. [2024-11-17 08:03:01,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:03:01,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 49 transitions. [2024-11-17 08:03:01,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-17 08:03:01,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-17 08:03:01,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-11-17 08:03:01,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:01,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:03:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-11-17 08:03:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2024-11-17 08:03:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-17 08:03:01,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-17 08:03:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 08:03:01,092 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-17 08:03:01,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:03:01,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2024-11-17 08:03:01,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:03:01,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:01,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:01,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:03:01,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:03:01,093 INFO L745 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 566#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 581#L14-1 assume !(build_nondet_String_~length~0#1 < 1); 582#L17-1 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 570#L19-1 assume true;main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 571#L14 assume !(build_nondet_String_~length~0#1 < 1); 577#L17 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset; 580#L19 assume true;main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset; 562#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 563#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 584#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 575#L33-2 assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 576#L33-1 assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1; 578#L35-1 call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1); 579#L35 assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset; 564#L30 assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1); 558#L30-2 assume !!(0 != cstrcspn_#t~mem2#1);havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1; 559#L33 [2024-11-17 08:03:01,093 INFO L747 eck$LassoCheckResult]: Loop: 559#L33 assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1; 572#L33-2 assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256); 567#L33-1 assume !!cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset; 559#L33 [2024-11-17 08:03:01,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2101371859, now seen corresponding path program 2 times [2024-11-17 08:03:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621145856] [2024-11-17 08:03:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:01,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2024-11-17 08:03:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792703241] [2024-11-17 08:03:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:01,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1474237218, now seen corresponding path program 1 times [2024-11-17 08:03:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65697945] [2024-11-17 08:03:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:01,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:02,173 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:02,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:02,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:02,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:02,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:03:02,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:02,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:02,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:02,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration5_Lasso [2024-11-17 08:03:02,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:02,174 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:02,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:02,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:03,314 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:03,314 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:03:03,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,320 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-17 08:03:03,321 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-17 08:03:03,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:03:03,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,347 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-17 08:03:03,348 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-17 08:03:03,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:03:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,378 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-17 08:03:03,379 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-17 08:03:03,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,403 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-17 08:03:03,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,405 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-17 08:03:03,406 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-17 08:03:03,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-17 08:03:03,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,430 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-17 08:03:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,432 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-17 08:03:03,432 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-17 08:03:03,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,444 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,444 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,455 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-17 08:03:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,457 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-17 08:03:03,457 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-17 08:03:03,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,482 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-17 08:03:03,482 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-17 08:03:03,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-17 08:03:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,507 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-17 08:03:03,507 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-17 08:03:03,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,533 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-17 08:03:03,535 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-17 08:03:03,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,557 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-17 08:03:03,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,558 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-17 08:03:03,560 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-17 08:03:03,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-17 08:03:03,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,571 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,582 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-17 08:03:03,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,583 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-17 08:03:03,584 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-17 08:03:03,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,605 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-17 08:03:03,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,607 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-17 08:03:03,607 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-17 08:03:03,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,629 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-17 08:03:03,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,630 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-17 08:03:03,630 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-17 08:03:03,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:03:03,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,654 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:03,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:03:03,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:03,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:03,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,700 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-17 08:03:03,701 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-17 08:03:03,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,723 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-17 08:03:03,724 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-17 08:03:03,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,735 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,746 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-17 08:03:03,747 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-17 08:03:03,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,769 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-17 08:03:03,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,770 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-17 08:03:03,770 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-17 08:03:03,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:03,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:03,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:03,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,793 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-17 08:03:03,793 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-17 08:03:03,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:03,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:03,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,824 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-17 08:03:03,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,827 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-17 08:03:03,828 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-17 08:03:03,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:03,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:03,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:03,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:03,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:03,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:03,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:03,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:03,853 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-17 08:03:03,854 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-17 08:03:03,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:03,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:03,865 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2024-11-17 08:03:03,865 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-11-17 08:03:03,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:03,945 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2024-11-17 08:03:03,945 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2024-11-17 08:03:04,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:04,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:03:04,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:04,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:04,095 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-17 08:03:04,095 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-17 08:03:04,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:04,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:04,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:04,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:04,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:04,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:04,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:04,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:04,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:04,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:04,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:04,120 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-17 08:03:04,121 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-17 08:03:04,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:03:04,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:04,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:04,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:04,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:04,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:04,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:04,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:03:04,156 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:03:04,156 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:03:04,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:04,158 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-17 08:03:04,160 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-17 08:03:04,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:03:04,171 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:03:04,172 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:03:04,172 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_2 Supporting invariants [] [2024-11-17 08:03:04,182 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-17 08:03:04,210 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-11-17 08:03:04,212 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2024-11-17 08:03:04,212 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:03:04,212 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:03:04,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,277 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-17 08:03:04,278 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:03:04,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,296 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 49 transitions. Complement of second has 5 states. [2024-11-17 08:03:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:03:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-11-17 08:03:04,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-17 08:03:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:04,298 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:03:04,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,357 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-17 08:03:04,357 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:03:04,357 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 49 transitions. Complement of second has 5 states. [2024-11-17 08:03:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:03:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2024-11-17 08:03:04,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-17 08:03:04,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:04,370 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:03:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:04,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:03:04,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:04,432 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-17 08:03:04,432 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:03:04,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 57 transitions. Complement of second has 4 states. [2024-11-17 08:03:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:03:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-17 08:03:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2024-11-17 08:03:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-17 08:03:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 3 letters. [2024-11-17 08:03:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:04,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 17 letters. Loop has 6 letters. [2024-11-17 08:03:04,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:04,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2024-11-17 08:03:04,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:03:04,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:03:04,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:03:04,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:03:04,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:03:04,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:03:04,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:03:04,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:03:04,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:03:04 BoogieIcfgContainer [2024-11-17 08:03:04,457 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:03:04,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:03:04,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:03:04,458 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:03:04,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:02:55" (3/4) ... [2024-11-17 08:03:04,460 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:03:04,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:03:04,461 INFO L158 Benchmark]: Toolchain (without parser) took 9177.16ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 112.1MB in the beginning and 130.1MB in the end (delta: -18.1MB). Peak memory consumption was 103.0MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,461 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:03:04,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.72ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 99.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.50ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,461 INFO L158 Benchmark]: Boogie Preprocessor took 24.46ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,461 INFO L158 Benchmark]: IcfgBuilder took 261.62ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 81.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,462 INFO L158 Benchmark]: BuchiAutomizer took 8650.64ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 81.1MB in the beginning and 130.1MB in the end (delta: -49.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-11-17 08:03:04,462 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 287.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:03:04,463 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.11ms. Allocated memory is still 167.8MB. Free memory is still 130.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.72ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 99.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.50ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 97.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.46ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 261.62ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 81.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 8650.64ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 81.1MB in the beginning and 130.1MB in the end (delta: -49.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 287.3MB. Free memory is still 130.1MB. 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: ~sc1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 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 [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 109 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital276 mio100 ax100 hnf100 lsp109 ukn55 mio100 lsp30 div173 bol100 ite100 ukn100 eq154 hnf97 smp67 dnf1127 smp24 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 226ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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-17 08:03:04,480 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-17 08:03:04,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:04,884 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