./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/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/cstrspn.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.graphml --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 ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 16:58:33,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 16:58:33,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 16:58:33,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 16:58:33,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 16:58:33,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 16:58:33,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 16:58:33,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 16:58:33,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 16:58:33,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 16:58:33,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 16:58:33,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 16:58:33,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 16:58:33,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 16:58:33,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 16:58:33,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 16:58:33,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 16:58:33,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 16:58:33,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 16:58:33,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 16:58:33,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 16:58:33,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 16:58:33,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 16:58:33,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 16:58:33,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 16:58:33,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 16:58:33,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 16:58:33,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 16:58:33,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 16:58:33,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 16:58:33,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 16:58:33,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 16:58:33,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 16:58:33,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 16:58:33,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 16:58:33,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 16:58:33,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 16:58:33,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 16:58:33,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 16:58:33,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 16:58:33,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 16:58:33,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-15 16:58:33,668 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 16:58:33,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 16:58:33,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 16:58:33,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 16:58:33,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 16:58:33,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 16:58:33,672 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 16:58:33,672 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 16:58:33,672 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 16:58:33,672 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 16:58:33,673 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 16:58:33,673 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 16:58:33,673 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 16:58:33,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 16:58:33,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 16:58:33,675 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 16:58:33,675 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 16:58:33,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 16:58:33,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 16:58:33,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 16:58:33,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 16:58:33,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 16:58:33,676 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 16:58:33,677 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 16:58:33,677 INFO L138 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.graphml 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 -> ecf20dd2c3ee96f4ce33fb05fe8b8a847f94671834911abc2dee98681c717cc6 [2021-12-15 16:58:33,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 16:58:33,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 16:58:33,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 16:58:33,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 16:58:33,931 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 16:58:33,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2021-12-15 16:58:33,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7038c37/32cc7547e4c24b76aa1067ca497e807a/FLAG8b186b14e [2021-12-15 16:58:34,396 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 16:58:34,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrspn.c [2021-12-15 16:58:34,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7038c37/32cc7547e4c24b76aa1067ca497e807a/FLAG8b186b14e [2021-12-15 16:58:34,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7038c37/32cc7547e4c24b76aa1067ca497e807a [2021-12-15 16:58:34,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 16:58:34,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 16:58:34,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 16:58:34,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 16:58:34,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 16:58:34,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3a9555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34, skipping insertion in model container [2021-12-15 16:58:34,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 16:58:34,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 16:58:34,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:58:34,642 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 16:58:34,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 16:58:34,682 INFO L208 MainTranslator]: Completed translation [2021-12-15 16:58:34,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34 WrapperNode [2021-12-15 16:58:34,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 16:58:34,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 16:58:34,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 16:58:34,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 16:58:34,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,759 INFO L137 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 81 [2021-12-15 16:58:34,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 16:58:34,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 16:58:34,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 16:58:34,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 16:58:34,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 16:58:34,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 16:58:34,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 16:58:34,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 16:58:34,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (1/1) ... [2021-12-15 16:58:34,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:34,877 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) [2021-12-15 16:58:34,882 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 [2021-12-15 16:58:34,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 16:58:34,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 16:58:34,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 16:58:34,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 16:58:34,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 16:58:34,945 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 16:58:34,946 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 16:58:35,102 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 16:58:35,106 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 16:58:35,106 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 16:58:35,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:58:35 BoogieIcfgContainer [2021-12-15 16:58:35,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 16:58:35,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 16:58:35,124 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 16:58:35,128 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 16:58:35,128 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:58:35,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 04:58:34" (1/3) ... [2021-12-15 16:58:35,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@245afc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 04:58:35, skipping insertion in model container [2021-12-15 16:58:35,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:58:35,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 04:58:34" (2/3) ... [2021-12-15 16:58:35,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@245afc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 04:58:35, skipping insertion in model container [2021-12-15 16:58:35,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 16:58:35,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:58:35" (3/3) ... [2021-12-15 16:58:35,130 INFO L388 chiAutomizerObserver]: Analyzing ICFG cstrspn.c [2021-12-15 16:58:35,186 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 16:58:35,186 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 16:58:35,186 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 16:58:35,186 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 16:58:35,186 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 16:58:35,186 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 16:58:35,186 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 16:58:35,186 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 16:58:35,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:35,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:35,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:35,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:35,216 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,216 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,216 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 16:58:35,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:35,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:35,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:35,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:35,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,220 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,226 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 10#L14true assume !(build_nondet_String_~length~0#1 < 1); 19#L14-2true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 11#L14-3true assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 15#L14-5true call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 7#L19-1true main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 16#L31-4true [2021-12-15 16:58:35,226 INFO L793 eck$LassoCheckResult]: Loop: 16#L31-4true call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 17#L31-1true assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 13#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 9#L36true assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 12#L31-3true cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 16#L31-4true [2021-12-15 16:58:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2021-12-15 16:58:35,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:35,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938768202] [2021-12-15 16:58:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:35,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,399 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:35,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2021-12-15 16:58:35,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:35,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525346898] [2021-12-15 16:58:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:35,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:35,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:58:35,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525346898] [2021-12-15 16:58:35,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525346898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:58:35,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:58:35,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 16:58:35,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843840795] [2021-12-15 16:58:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:58:35,452 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 16:58:35,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:58:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 16:58:35,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 16:58:35,479 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-12-15 16:58:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:58:35,484 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-12-15 16:58:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 16:58:35,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2021-12-15 16:58:35,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:35,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2021-12-15 16:58:35,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-15 16:58:35,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-15 16:58:35,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2021-12-15 16:58:35,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 16:58:35,496 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:58:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2021-12-15 16:58:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-15 16:58:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-12-15 16:58:35,513 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:58:35,513 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-15 16:58:35,513 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 16:58:35,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2021-12-15 16:58:35,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-15 16:58:35,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:35,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:35,517 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:35,518 INFO L791 eck$LassoCheckResult]: Stem: 50#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 51#L-1 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 57#L14 assume !(build_nondet_String_~length~0#1 < 1); 58#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 65#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 59#L14-3 assume build_nondet_String_~length~0#1 < 1;build_nondet_String_~length~0#1 := 1; 60#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 54#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 55#L31-4 [2021-12-15 16:58:35,518 INFO L793 eck$LassoCheckResult]: Loop: 55#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 64#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 61#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 62#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 63#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 52#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 53#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 56#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 55#L31-4 [2021-12-15 16:58:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2021-12-15 16:58:35,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:35,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789994962] [2021-12-15 16:58:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:35,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,574 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:35,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2021-12-15 16:58:35,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800832665] [2021-12-15 16:58:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:35,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:35,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2021-12-15 16:58:35,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974384786] [2021-12-15 16:58:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:35,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:35,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:58:35,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974384786] [2021-12-15 16:58:35,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974384786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:58:35,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:58:35,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 16:58:35,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349386595] [2021-12-15 16:58:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:58:36,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:58:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 16:58:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 16:58:36,235 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2021-12-15 16:58:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:58:36,463 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-15 16:58:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 16:58:36,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2021-12-15 16:58:36,466 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-15 16:58:36,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 38 transitions. [2021-12-15 16:58:36,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-15 16:58:36,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-15 16:58:36,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2021-12-15 16:58:36,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 16:58:36,467 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-12-15 16:58:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2021-12-15 16:58:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-15 16:58:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 28 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) [2021-12-15 16:58:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-15 16:58:36,471 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-15 16:58:36,471 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-15 16:58:36,471 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 16:58:36,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2021-12-15 16:58:36,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-15 16:58:36,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:36,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:36,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:36,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:36,473 INFO L791 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 127#L-1 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 132#L14 assume !(build_nondet_String_~length~0#1 < 1); 134#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 145#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 135#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 136#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 130#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 131#L31-4 [2021-12-15 16:58:36,473 INFO L793 eck$LassoCheckResult]: Loop: 131#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 143#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 149#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 154#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 153#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 152#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 151#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 138#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 131#L31-4 [2021-12-15 16:58:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:36,473 INFO L85 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2021-12-15 16:58:36,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:36,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064849897] [2021-12-15 16:58:36,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:36,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,497 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2021-12-15 16:58:36,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:36,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965419034] [2021-12-15 16:58:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:36,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:36,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2021-12-15 16:58:36,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:36,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192559817] [2021-12-15 16:58:36,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:36,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:36,555 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:37,145 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:58:37,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:58:37,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:58:37,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:58:37,146 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:58:37,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:37,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:58:37,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:58:37,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration3_Lasso [2021-12-15 16:58:37,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:58:37,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:58:37,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:37,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:58:37,965 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:58:37,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:37,975 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) [2021-12-15 16:58:37,976 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 [2021-12-15 16:58:37,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:37,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:37,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:37,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:37,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:37,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:37,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:37,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:38,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:38,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:38,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:38,037 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) [2021-12-15 16:58:38,048 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 [2021-12-15 16:58:38,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:38,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:38,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:38,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:38,056 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-15 16:58:38,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:38,062 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-15 16:58:38,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:38,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:38,109 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 [2021-12-15 16:58:38,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:38,113 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) [2021-12-15 16:58:38,114 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 [2021-12-15 16:58:38,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:38,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:38,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:38,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:38,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:38,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:38,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:38,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:38,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:38,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:38,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:38,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:38,209 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) [2021-12-15 16:58:38,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:38,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:38,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:38,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:38,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:38,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:38,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:38,235 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 [2021-12-15 16:58:38,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:38,277 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 [2021-12-15 16:58:38,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:38,279 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) [2021-12-15 16:58:38,288 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 [2021-12-15 16:58:38,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:38,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:38,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:38,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:38,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:38,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:38,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:38,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:58:38,332 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2021-12-15 16:58:38,332 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2021-12-15 16:58:38,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:38,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:38,335 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) [2021-12-15 16:58:38,336 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 [2021-12-15 16:58:38,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:58:38,356 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:58:38,356 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:58:38,357 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10#1.base)_1 Supporting invariants [] [2021-12-15 16:58:38,388 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 [2021-12-15 16:58:38,400 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2021-12-15 16:58:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:38,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 16:58:38,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:38,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 16:58:38,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:38,542 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 16:58:38,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-15 16:58:38,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 48 states and 62 transitions. Complement of second has 4 states. [2021-12-15 16:58:38,602 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 [2021-12-15 16:58:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-12-15 16:58:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2021-12-15 16:58:38,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2021-12-15 16:58:38,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:38,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2021-12-15 16:58:38,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:38,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2021-12-15 16:58:38,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:38,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2021-12-15 16:58:38,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 16:58:38,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 56 transitions. [2021-12-15 16:58:38,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 16:58:38,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-15 16:58:38,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2021-12-15 16:58:38,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:58:38,608 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2021-12-15 16:58:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2021-12-15 16:58:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2021-12-15 16:58:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2021-12-15 16:58:38,610 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2021-12-15 16:58:38,610 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2021-12-15 16:58:38,611 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 16:58:38,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2021-12-15 16:58:38,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 16:58:38,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:38,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:38,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:38,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:58:38,613 INFO L791 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 301#L-1 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 308#L14 assume !(build_nondet_String_~length~0#1 < 1); 309#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 326#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 311#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 312#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 321#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 333#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 323#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 314#L34-5 [2021-12-15 16:58:38,613 INFO L793 eck$LassoCheckResult]: Loop: 314#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 315#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 318#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 314#L34-5 [2021-12-15 16:58:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2021-12-15 16:58:38,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:38,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009972439] [2021-12-15 16:58:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:38,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,635 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2021-12-15 16:58:38,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757734523] [2021-12-15 16:58:38,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:38,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2021-12-15 16:58:38,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:38,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876154965] [2021-12-15 16:58:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:38,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:38,680 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:38,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:39,176 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:58:39,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:58:39,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:58:39,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:58:39,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:58:39,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:39,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:58:39,176 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:58:39,176 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration4_Lasso [2021-12-15 16:58:39,176 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:58:39,176 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:58:39,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:39,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:40,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:58:40,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:58:40,128 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,133 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) [2021-12-15 16:58:40,156 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 [2021-12-15 16:58:40,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-12-15 16:58:40,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,193 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) [2021-12-15 16:58:40,195 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 [2021-12-15 16:58:40,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,237 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) [2021-12-15 16:58:40,238 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 [2021-12-15 16:58:40,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:40,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:40,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,281 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 [2021-12-15 16:58:40,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,293 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) [2021-12-15 16:58:40,297 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 [2021-12-15 16:58:40,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,361 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 [2021-12-15 16:58:40,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,363 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) [2021-12-15 16:58:40,365 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 [2021-12-15 16:58:40,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,406 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 [2021-12-15 16:58:40,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,408 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) [2021-12-15 16:58:40,409 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 [2021-12-15 16:58:40,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,453 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 [2021-12-15 16:58:40,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,455 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) [2021-12-15 16:58:40,456 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 [2021-12-15 16:58:40,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,510 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) [2021-12-15 16:58:40,510 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 [2021-12-15 16:58:40,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 16:58:40,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-15 16:58:40,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:40,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:40,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:40,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,601 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) [2021-12-15 16:58:40,602 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 [2021-12-15 16:58:40,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:40,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:40,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:40,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,660 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) [2021-12-15 16:58:40,668 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 [2021-12-15 16:58:40,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:40,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:40,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:40,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:40,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:40,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:40,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:40,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:58:40,720 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 16:58:40,720 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2021-12-15 16:58:40,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:40,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:40,736 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) [2021-12-15 16:58:40,737 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 [2021-12-15 16:58:40,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:58:40,770 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:58:40,770 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:58:40,770 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2, ULTIMATE.start_cstrspn_~s~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0#1.offset Supporting invariants [] [2021-12-15 16:58:40,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:40,803 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2021-12-15 16:58:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:40,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 16:58:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:40,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 16:58:40,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:40,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 16:58:40,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15 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) [2021-12-15 16:58:40,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 15. 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 81 states and 107 transitions. Complement of second has 7 states. [2021-12-15 16:58:40,992 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 [2021-12-15 16:58:40,993 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) [2021-12-15 16:58:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-12-15 16:58:40,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-15 16:58:40,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:40,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-15 16:58:40,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:40,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-15 16:58:40,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:40,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2021-12-15 16:58:40,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 16:58:40,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 61 states and 80 transitions. [2021-12-15 16:58:40,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 16:58:40,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 16:58:40,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 80 transitions. [2021-12-15 16:58:40,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:58:40,997 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 80 transitions. [2021-12-15 16:58:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 80 transitions. [2021-12-15 16:58:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2021-12-15 16:58:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 47 states have internal predecessors, (64), 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) [2021-12-15 16:58:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2021-12-15 16:58:41,000 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-15 16:58:41,000 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-15 16:58:41,000 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 16:58:41,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 64 transitions. [2021-12-15 16:58:41,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 16:58:41,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:41,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:41,002 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:41,002 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:58:41,002 INFO L791 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 521#L-1 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 527#L14 assume !(build_nondet_String_~length~0#1 < 1); 528#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 545#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 530#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 531#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 539#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 558#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 557#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 550#L34-1 assume !cstrspn_#t~short7#1; 551#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 564#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 563#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 562#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 561#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 542#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 533#L34-5 [2021-12-15 16:58:41,002 INFO L793 eck$LassoCheckResult]: Loop: 533#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 534#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 537#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 533#L34-5 [2021-12-15 16:58:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2021-12-15 16:58:41,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:41,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804399177] [2021-12-15 16:58:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:41,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:41,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 16:58:41,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804399177] [2021-12-15 16:58:41,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804399177] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 16:58:41,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 16:58:41,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 16:58:41,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56708907] [2021-12-15 16:58:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 16:58:41,043 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 16:58:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2021-12-15 16:58:41,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:41,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227243389] [2021-12-15 16:58:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:41,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:41,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 16:58:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 16:58:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 16:58:41,126 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 16:58:41,181 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2021-12-15 16:58:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 16:58:41,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2021-12-15 16:58:41,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 16:58:41,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 54 states and 68 transitions. [2021-12-15 16:58:41,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-15 16:58:41,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-12-15 16:58:41,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 68 transitions. [2021-12-15 16:58:41,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-15 16:58:41,184 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 68 transitions. [2021-12-15 16:58:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 68 transitions. [2021-12-15 16:58:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2021-12-15 16:58:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2021-12-15 16:58:41,189 INFO L704 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2021-12-15 16:58:41,189 INFO L587 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2021-12-15 16:58:41,189 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 16:58:41,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2021-12-15 16:58:41,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-12-15 16:58:41,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 16:58:41,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 16:58:41,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 16:58:41,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-15 16:58:41,191 INFO L791 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 647#L-1 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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 652#L14 assume !(build_nondet_String_~length~0#1 < 1); 654#L14-2 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 673#L19 main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#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;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1; 655#L14-3 assume !(build_nondet_String_~length~0#1 < 1); 656#L14-5 call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1);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, 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; 650#L19-1 main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset, cstrspn_#in~s2#1.base, cstrspn_#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 cstrspn_#res#1;havoc cstrspn_#t~mem4#1, cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset, cstrspn_#t~mem5#1, cstrspn_#t~mem6#1, cstrspn_#t~short7#1, cstrspn_#t~mem9#1, cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset, cstrspn_#t~mem3#1, cstrspn_~s1#1.base, cstrspn_~s1#1.offset, cstrspn_~s2#1.base, cstrspn_~s2#1.offset, cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, cstrspn_~c~0#1;cstrspn_~s1#1.base, cstrspn_~s1#1.offset := cstrspn_#in~s1#1.base, cstrspn_#in~s1#1.offset;cstrspn_~s2#1.base, cstrspn_~s2#1.offset := cstrspn_#in~s2#1.base, cstrspn_#in~s2#1.offset;havoc cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;havoc cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;havoc cstrspn_~c~0#1;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_~s1#1.base, cstrspn_~s1#1.offset; 651#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 682#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 679#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 681#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 675#L34-3 assume !cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1; 648#L34-6 call cstrspn_#t~mem9#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1); 649#L36 assume !(cstrspn_#t~mem9#1 != cstrspn_~c~0#1);havoc cstrspn_#t~mem9#1; 653#L31-3 cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset := cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset;cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset := cstrspn_#t~post2#1.base, 1 + cstrspn_#t~post2#1.offset;havoc cstrspn_#t~post2#1.base, cstrspn_#t~post2#1.offset; 658#L31-4 call cstrspn_#t~mem3#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1); 670#L31-1 assume !!(0 != cstrspn_#t~mem3#1);havoc cstrspn_#t~mem3#1;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_~s2#1.base, cstrspn_~s2#1.offset;call cstrspn_#t~mem4#1 := read~int(cstrspn_~sc1~0#1.base, cstrspn_~sc1~0#1.offset, 1);cstrspn_~c~0#1 := cstrspn_#t~mem4#1;havoc cstrspn_#t~mem4#1; 659#L34-5 [2021-12-15 16:58:41,191 INFO L793 eck$LassoCheckResult]: Loop: 659#L34-5 call cstrspn_#t~mem5#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := 0 != cstrspn_#t~mem5#1; 660#L34-1 assume cstrspn_#t~short7#1;call cstrspn_#t~mem6#1 := read~int(cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset, 1);cstrspn_#t~short7#1 := cstrspn_#t~mem6#1 != (if cstrspn_~c~0#1 % 256 <= 127 then cstrspn_~c~0#1 % 256 else cstrspn_~c~0#1 % 256 - 256); 663#L34-3 assume !!cstrspn_#t~short7#1;havoc cstrspn_#t~mem5#1;havoc cstrspn_#t~mem6#1;havoc cstrspn_#t~short7#1;cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset := cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset;cstrspn_~s~0#1.base, cstrspn_~s~0#1.offset := cstrspn_#t~post8#1.base, 1 + cstrspn_#t~post8#1.offset;havoc cstrspn_#t~post8#1.base, cstrspn_#t~post8#1.offset; 659#L34-5 [2021-12-15 16:58:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2021-12-15 16:58:41,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:41,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637752649] [2021-12-15 16:58:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:41,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2021-12-15 16:58:41,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:41,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197749824] [2021-12-15 16:58:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:41,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,222 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2021-12-15 16:58:41,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 16:58:41,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268634310] [2021-12-15 16:58:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 16:58:41,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 16:58:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 16:58:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 16:58:41,249 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 16:58:41,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:42,178 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 16:58:42,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 16:58:42,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 16:58:42,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 16:58:42,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 16:58:42,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:42,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 16:58:42,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 16:58:42,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn.c_Iteration6_Lasso [2021-12-15 16:58:42,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 16:58:42,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 16:58:42,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:42,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 16:58:44,067 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 16:58:44,068 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 16:58:44,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,074 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) [2021-12-15 16:58:44,076 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 [2021-12-15 16:58:44,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,101 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 [2021-12-15 16:58:44,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,103 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) [2021-12-15 16:58:44,106 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 [2021-12-15 16:58:44,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:44,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:44,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,185 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 [2021-12-15 16:58:44,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,187 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) [2021-12-15 16:58:44,188 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 [2021-12-15 16:58:44,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,222 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 [2021-12-15 16:58:44,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,226 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) [2021-12-15 16:58:44,227 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 [2021-12-15 16:58:44,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,258 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 [2021-12-15 16:58:44,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,260 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) [2021-12-15 16:58:44,262 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 [2021-12-15 16:58:44,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,300 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 [2021-12-15 16:58:44,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,308 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) [2021-12-15 16:58:44,309 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 [2021-12-15 16:58:44,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-15 16:58:44,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,350 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) [2021-12-15 16:58:44,351 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 [2021-12-15 16:58:44,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,391 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 [2021-12-15 16:58:44,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,392 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) [2021-12-15 16:58:44,393 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 [2021-12-15 16:58:44,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:44,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:44,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,424 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 [2021-12-15 16:58:44,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,425 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) [2021-12-15 16:58:44,426 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 [2021-12-15 16:58:44,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 16:58:44,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 16:58:44,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 16:58:44,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 16:58:44,451 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 [2021-12-15 16:58:44,452 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,453 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) [2021-12-15 16:58:44,454 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 [2021-12-15 16:58:44,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 16:58:44,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 16:58:44,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 16:58:44,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 16:58:44,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 16:58:44,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 16:58:44,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 16:58:44,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 16:58:44,503 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-12-15 16:58:44,504 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 16:58:44,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 16:58:44,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 16:58:44,505 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) [2021-12-15 16:58:44,506 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 [2021-12-15 16:58:44,507 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 16:58:44,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 16:58:44,540 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 16:58:44,540 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_~nondetString~0#1.base)_3 Supporting invariants [] [2021-12-15 16:58:44,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-15 16:58:44,625 INFO L297 tatePredicateManager]: 18 out of 20 supporting invariants were superfluous and have been removed [2021-12-15 16:58:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:44,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 16:58:44,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:44,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 16:58:44,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:44,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 16:58:44,816 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:44,871 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 99 transitions. Complement of second has 7 states. [2021-12-15 16:58:44,873 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 [2021-12-15 16:58:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-12-15 16:58:44,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-15 16:58:44,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:44,876 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:44,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 16:58:44,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:45,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 16:58:45,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:45,075 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 [2021-12-15 16:58:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:45,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 16:58:45,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:45,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 79 states and 99 transitions. Complement of second has 7 states. [2021-12-15 16:58:45,141 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 [2021-12-15 16:58:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-12-15 16:58:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-15 16:58:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:45,146 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-15 16:58:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 16:58:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:45,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 16:58:45,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 16:58:45,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 16:58:45,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 16:58:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 16:58:45,285 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2021-12-15 16:58:45,285 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:45,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 63 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 102 transitions. Complement of second has 6 states. [2021-12-15 16:58:45,323 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 [2021-12-15 16:58:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 16:58:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2021-12-15 16:58:45,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 3 letters. [2021-12-15 16:58:45,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:45,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 21 letters. Loop has 3 letters. [2021-12-15 16:58:45,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:45,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 18 letters. Loop has 6 letters. [2021-12-15 16:58:45,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 16:58:45,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2021-12-15 16:58:45,326 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 16:58:45,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 16:58:45,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 16:58:45,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 16:58:45,326 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 16:58:45,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 16:58:45,326 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 16:58:45,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 16:58:45,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 04:58:45 BoogieIcfgContainer [2021-12-15 16:58:45,333 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 16:58:45,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 16:58:45,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 16:58:45,334 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 16:58:45,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 04:58:35" (3/4) ... [2021-12-15 16:58:45,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 16:58:45,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 16:58:45,338 INFO L158 Benchmark]: Toolchain (without parser) took 10914.99ms. Allocated memory was 92.3MB in the beginning and 174.1MB in the end (delta: 81.8MB). Free memory was 61.3MB in the beginning and 117.3MB in the end (delta: -56.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,338 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 16:58:45,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.30ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.3MB in the beginning and 88.3MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.68ms. Allocated memory is still 111.1MB. Free memory was 88.3MB in the beginning and 86.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,339 INFO L158 Benchmark]: Boogie Preprocessor took 70.80ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 85.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,339 INFO L158 Benchmark]: RCFGBuilder took 291.13ms. Allocated memory is still 111.1MB. Free memory was 85.0MB in the beginning and 73.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,340 INFO L158 Benchmark]: BuchiAutomizer took 10209.37ms. Allocated memory was 111.1MB in the beginning and 174.1MB in the end (delta: 62.9MB). Free memory was 73.7MB in the beginning and 118.4MB in the end (delta: -44.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,340 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 117.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 16:58:45,342 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.30ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.3MB in the beginning and 88.3MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.68ms. Allocated memory is still 111.1MB. Free memory was 88.3MB in the beginning and 86.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.80ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 85.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.13ms. Allocated memory is still 111.1MB. Free memory was 85.0MB in the beginning and 73.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 10209.37ms. Allocated memory was 111.1MB in the beginning and 174.1MB in the end (delta: 62.9MB). Free memory was 73.7MB in the beginning and 118.4MB in the end (delta: -44.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 174.1MB. Free memory was 118.4MB in the beginning and 117.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 140 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp106 ukn81 mio100 lsp31 div129 bol100 ite100 ukn100 eq161 hnf81 smp88 dnf735 smp41 tf100 neg96 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 7 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 16:58:45,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE