./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-memory-alloca/substring-alloca-1.i -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 29f46a81991b9bc0fef856343662e1cc264d2d45 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:02:28,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:02:28,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:02:28,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:02:28,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:02:28,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:02:28,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:02:28,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:02:28,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:02:28,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:02:28,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:02:28,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:02:28,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:02:28,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:02:28,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:02:28,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:02:28,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:02:28,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:02:28,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:02:28,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:02:28,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:02:28,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:02:28,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:02:28,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:02:28,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:02:28,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:02:28,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:02:28,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:02:28,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:02:28,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:02:28,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:02:28,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:02:28,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:02:28,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:02:28,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:02:28,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:02:28,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:02:28,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:02:28,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:02:28,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:02:28,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:02:28,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:02:28,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:02:28,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:02:28,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:02:28,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:02:28,758 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:02:28,759 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:02:28,759 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:02:28,759 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:02:28,759 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:02:28,760 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:02:28,760 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:02:28,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:02:28,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:02:28,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:02:28,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:02:28,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:02:28,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:02:28,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:02:28,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:02:28,762 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:02:28,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:02:28,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:02:28,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:02:28,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:02:28,764 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:02:28,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:02:28,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:02:28,765 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:02:28,766 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:02:28,766 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 29f46a81991b9bc0fef856343662e1cc264d2d45 [2019-11-28 03:02:29,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:02:29,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:02:29,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:02:29,093 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:02:29,094 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:02:29,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-11-28 03:02:29,168 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d8d482b/94381c7147c84b0f886926cdf14e648f/FLAG13bf02fd5 [2019-11-28 03:02:29,725 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:02:29,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2019-11-28 03:02:29,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d8d482b/94381c7147c84b0f886926cdf14e648f/FLAG13bf02fd5 [2019-11-28 03:02:30,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d8d482b/94381c7147c84b0f886926cdf14e648f [2019-11-28 03:02:30,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:02:30,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:02:30,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:30,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:02:30,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:02:30,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e4995b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30, skipping insertion in model container [2019-11-28 03:02:30,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:02:30,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:02:30,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:30,495 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:02:30,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:02:30,594 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:02:30,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30 WrapperNode [2019-11-28 03:02:30,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:02:30,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:30,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:02:30,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:02:30,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:02:30,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:02:30,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:02:30,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:02:30,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... [2019-11-28 03:02:30,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:02:30,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:02:30,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:02:30,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:02:30,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:30,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:02:30,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:02:30,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:02:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:02:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:02:30,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:02:31,102 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:02:31,103 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:02:31,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:31 BoogieIcfgContainer [2019-11-28 03:02:31,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:02:31,105 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:02:31,105 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:02:31,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:02:31,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:31,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:02:30" (1/3) ... [2019-11-28 03:02:31,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c7135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:31, skipping insertion in model container [2019-11-28 03:02:31,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:31,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:02:30" (2/3) ... [2019-11-28 03:02:31,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c7135c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:02:31, skipping insertion in model container [2019-11-28 03:02:31,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:02:31,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:31" (3/3) ... [2019-11-28 03:02:31,114 INFO L371 chiAutomizerObserver]: Analyzing ICFG substring-alloca-1.i [2019-11-28 03:02:31,160 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:02:31,160 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:02:31,160 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:02:31,160 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:02:31,161 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:02:31,161 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:02:31,161 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:02:31,161 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:02:31,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 03:02:31,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:02:31,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:31,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:31,206 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:31,206 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:31,206 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:02:31,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-28 03:02:31,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:02:31,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:31,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:31,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:31,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:31,218 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 8#L568-1true call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 4#L550-3true [2019-11-28 03:02:31,218 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 19#L550-1true assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 3#L553-5true assume !true; 5#L553-6true call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 6#L557true assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 4#L550-3true [2019-11-28 03:02:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-28 03:02:31,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:31,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167140659] [2019-11-28 03:02:31,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 47887114, now seen corresponding path program 1 times [2019-11-28 03:02:31,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:31,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429192422] [2019-11-28 03:02:31,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:31,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429192422] [2019-11-28 03:02:31,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:31,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:02:31,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910510731] [2019-11-28 03:02:31,459 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:02:31,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:02:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:02:31,484 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-28 03:02:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:31,494 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-11-28 03:02:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:02:31,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2019-11-28 03:02:31,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:02:31,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 16 transitions. [2019-11-28 03:02:31,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:02:31,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:02:31,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 03:02:31,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:02:31,508 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:02:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 03:02:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 03:02:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:02:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 03:02:31,544 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:02:31,544 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:02:31,544 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:02:31,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 03:02:31,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:02:31,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:31,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:31,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:02:31,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:31,546 INFO L794 eck$LassoCheckResult]: Stem: 48#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 44#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 45#L565 assume !(main_~length1~0 < 1); 49#L565-2 assume !(main_~length2~0 < 1); 50#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 51#L550-3 [2019-11-28 03:02:31,547 INFO L796 eck$LassoCheckResult]: Loop: 51#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 52#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 42#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 43#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 53#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 46#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 47#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 51#L550-3 [2019-11-28 03:02:31,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-28 03:02:31,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:31,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35665614] [2019-11-28 03:02:31,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:31,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1237496093, now seen corresponding path program 1 times [2019-11-28 03:02:31,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:31,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453431677] [2019-11-28 03:02:31,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1302992386, now seen corresponding path program 1 times [2019-11-28 03:02:31,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:31,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986441953] [2019-11-28 03:02:31,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:31,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:32,022 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-28 03:02:32,525 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-11-28 03:02:32,680 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 03:02:32,694 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:02:32,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:02:32,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:02:32,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:02:32,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:02:32,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:32,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:02:32,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:02:32,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration2_Lasso [2019-11-28 03:02:32,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:02:32,697 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:02:32,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,167 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-28 03:02:33,332 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 03:02:33,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:33,870 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-28 03:02:34,125 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:02:34,130 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:34,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:34,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,154 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-28 03:02:34,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,167 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-28 03:02:34,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:34,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:34,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:34,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:34,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:34,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:34,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:34,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:34,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:34,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:34,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:34,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:34,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:34,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:34,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:34,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:34,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:34,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:34,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:34,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:34,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:34,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:34,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:34,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:34,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:34,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:02:34,434 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 03:02:34,434 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:34,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:02:34,498 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:02:34,498 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:02:34,499 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_substring_~ps~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_substring_~ps~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2019-11-28 03:02:34,534 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:02:34,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:02:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:34,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:02:34,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:34,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:02:34,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:34,682 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 [2019-11-28 03:02:34,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-28 03:02:34,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 26 transitions. Complement of second has 4 states. [2019-11-28 03:02:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:02:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-28 03:02:34,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 7 letters. [2019-11-28 03:02:34,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:34,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 12 letters. Loop has 7 letters. [2019-11-28 03:02:34,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:34,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-28 03:02:34,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:34,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2019-11-28 03:02:34,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:34,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2019-11-28 03:02:34,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:02:34,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:02:34,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-11-28 03:02:34,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:34,770 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:02:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-11-28 03:02:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:02:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:02:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-28 03:02:34,773 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:02:34,773 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-28 03:02:34,773 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:02:34,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-28 03:02:34,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:34,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:34,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:34,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:34,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:34,775 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 174#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 175#L565 assume !(main_~length1~0 < 1); 183#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 178#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 180#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 170#L553-5 [2019-11-28 03:02:34,775 INFO L796 eck$LassoCheckResult]: Loop: 170#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 171#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 185#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 170#L553-5 [2019-11-28 03:02:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2019-11-28 03:02:34,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:34,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811472857] [2019-11-28 03:02:34,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 1 times [2019-11-28 03:02:34,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:34,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703672327] [2019-11-28 03:02:34,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:34,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1594173083, now seen corresponding path program 1 times [2019-11-28 03:02:34,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:34,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243910779] [2019-11-28 03:02:34,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:34,929 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:35,071 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-28 03:02:35,513 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-11-28 03:02:35,759 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-28 03:02:35,766 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:02:35,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:02:35,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:02:35,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:02:35,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:02:35,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:35,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:02:35,767 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:02:35,767 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration3_Lasso [2019-11-28 03:02:35,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:02:35,767 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:02:35,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:35,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:36,300 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-11-28 03:02:36,478 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-28 03:02:36,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:36,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:36,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:36,695 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-28 03:02:37,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:02:37,261 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:37,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:37,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,567 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:37,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:37,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:37,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:37,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:37,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:37,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:37,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:37,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:37,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:37,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:02:37,869 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-28 03:02:37,869 INFO L444 ModelExtractionUtils]: 20 out of 43 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:37,880 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:37,884 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:02:37,885 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:02:37,885 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2019-11-28 03:02:38,032 INFO L297 tatePredicateManager]: 22 out of 23 supporting invariants were superfluous and have been removed [2019-11-28 03:02:38,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:02:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:38,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 03:02:38,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:38,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 03:02:38,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:38,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:02:38,183 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-28 03:02:38,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 40 states and 54 transitions. Complement of second has 6 states. [2019-11-28 03:02:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:02:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-28 03:02:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 03:02:38,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 03:02:38,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:38,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 03:02:38,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:38,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-11-28 03:02:38,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:38,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 28 states and 38 transitions. [2019-11-28 03:02:38,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:02:38,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:02:38,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-11-28 03:02:38,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:38,277 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 03:02:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-11-28 03:02:38,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-28 03:02:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:02:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-11-28 03:02:38,285 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-28 03:02:38,285 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-28 03:02:38,285 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:02:38,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-11-28 03:02:38,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:38,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:38,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:38,288 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:38,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:38,290 INFO L794 eck$LassoCheckResult]: Stem: 384#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 378#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 379#L565 assume !(main_~length1~0 < 1); 385#L565-2 assume !(main_~length2~0 < 1); 386#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 387#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 388#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 397#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 399#L553-1 assume !substring_#t~short6; 398#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 392#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 393#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 389#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 391#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 380#L553-5 [2019-11-28 03:02:38,291 INFO L796 eck$LassoCheckResult]: Loop: 380#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 381#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 394#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 380#L553-5 [2019-11-28 03:02:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2012026433, now seen corresponding path program 1 times [2019-11-28 03:02:38,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:38,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967386547] [2019-11-28 03:02:38,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:38,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967386547] [2019-11-28 03:02:38,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:38,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:02:38,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156469939] [2019-11-28 03:02:38,381 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:02:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 2 times [2019-11-28 03:02:38,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:38,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816631797] [2019-11-28 03:02:38,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:38,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:38,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:02:38,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:02:38,512 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-28 03:02:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:38,552 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-28 03:02:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:02:38,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-28 03:02:38,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:02:38,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 34 transitions. [2019-11-28 03:02:38,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:02:38,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 03:02:38,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-28 03:02:38,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:38,555 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-28 03:02:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-28 03:02:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 03:02:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:02:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2019-11-28 03:02:38,559 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-28 03:02:38,559 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-11-28 03:02:38,559 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:02:38,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2019-11-28 03:02:38,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:38,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:38,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:38,561 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:38,561 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:38,561 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 440#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 441#L565 assume !(main_~length1~0 < 1); 447#L565-2 assume !(main_~length2~0 < 1); 448#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 449#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 450#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 459#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 461#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 460#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 454#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 455#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 451#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 453#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 442#L553-5 [2019-11-28 03:02:38,561 INFO L796 eck$LassoCheckResult]: Loop: 442#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 443#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 456#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 442#L553-5 [2019-11-28 03:02:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1954768131, now seen corresponding path program 2 times [2019-11-28 03:02:38,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:38,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738792450] [2019-11-28 03:02:38,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,595 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 59685, now seen corresponding path program 3 times [2019-11-28 03:02:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:38,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189788963] [2019-11-28 03:02:38,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -964145949, now seen corresponding path program 1 times [2019-11-28 03:02:38,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:38,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457299300] [2019-11-28 03:02:38,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:38,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:38,772 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-28 03:02:39,729 WARN L192 SmtUtils]: Spent 923.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 143 [2019-11-28 03:02:39,947 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-28 03:02:39,950 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:02:39,951 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:02:39,951 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:02:39,951 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:02:39,951 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:02:39,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:39,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:02:39,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:02:39,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: substring-alloca-1.i_Iteration5_Lasso [2019-11-28 03:02:39,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:02:39,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:02:39,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:39,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,648 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-11-28 03:02:40,920 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-28 03:02:40,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:40,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:02:41,362 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-28 03:02:42,079 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-28 03:02:42,300 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:02:42,301 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:42,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:42,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:42,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:42,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:42,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:42,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:02:42,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:42,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:02:42,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:02:42,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,521 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,560 INFO L203 nArgumentSynthesizer]: 12 stem disjuncts [2019-11-28 03:02:42,560 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:02:42,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,583 INFO L401 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2019-11-28 03:02:42,583 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:02:42,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:02:42,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:02:42,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:02:42,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:02:42,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:02:42,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:02:42,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:02:42,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:02:42,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:02:42,785 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-11-28 03:02:42,786 INFO L444 ModelExtractionUtils]: 26 out of 58 variables were initially zero. Simplification set additionally 29 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:02:42,790 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:02:42,792 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:02:42,792 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:02:42,793 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2, ULTIMATE.start_substring_~ps2~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0.base)_2 - 1*ULTIMATE.start_substring_~ps2~0.offset Supporting invariants [] [2019-11-28 03:02:42,986 INFO L297 tatePredicateManager]: 43 out of 45 supporting invariants were superfluous and have been removed [2019-11-28 03:02:42,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:02:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:43,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:02:43,082 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:02:43,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2019-11-28 03:02:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:02:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 03:02:43,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:02:43,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:43,151 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:02:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:43,238 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:02:43,238 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:02:43,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 42 states and 54 transitions. Complement of second has 8 states. [2019-11-28 03:02:43,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:02:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 03:02:43,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:02:43,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:43,287 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:02:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:02:43,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:02:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:43,366 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 03:02:43,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:02:43,425 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 50 states and 66 transitions. Complement of second has 7 states. [2019-11-28 03:02:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:02:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:02:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-28 03:02:43,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 03:02:43,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:43,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-28 03:02:43,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:43,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 03:02:43,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:02:43,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2019-11-28 03:02:43,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:43,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 41 states and 54 transitions. [2019-11-28 03:02:43,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 03:02:43,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:02:43,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2019-11-28 03:02:43,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:02:43,433 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-11-28 03:02:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2019-11-28 03:02:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-28 03:02:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:02:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2019-11-28 03:02:43,437 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-11-28 03:02:43,437 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 52 transitions. [2019-11-28 03:02:43,437 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:02:43,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 52 transitions. [2019-11-28 03:02:43,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:02:43,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:02:43,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:02:43,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:02:43,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:02:43,439 INFO L794 eck$LassoCheckResult]: Stem: 1003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 994#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 995#L565 assume !(main_~length1~0 < 1); 1004#L565-2 assume !(main_~length2~0 < 1); 1005#L568-1 call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 998#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 999#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1024#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 1014#L553-1 assume substring_#t~short6;call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1);substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 1013#L553-3 assume !substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5; 996#L553-6 call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); 997#L557 assume !(0 == substring_#t~mem9);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, 1 + substring_#t~post10.offset;havoc substring_#t~post10.base, substring_#t~post10.offset; 1000#L550-3 call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); 1002#L550-1 assume !!(0 != substring_#t~mem2);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 1011#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 991#L553-1 [2019-11-28 03:02:43,439 INFO L796 eck$LassoCheckResult]: Loop: 991#L553-1 assume !substring_#t~short6; 1006#L553-3 assume !!substring_#t~short6;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;havoc substring_#t~mem5;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, 1 + substring_#t~post7.offset;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, 1 + substring_#t~post8.offset;havoc substring_#t~post8.base, substring_#t~post8.offset; 990#L553-5 call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1);substring_#t~short6 := 0 != substring_#t~mem3; 991#L553-1 [2019-11-28 03:02:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash 468269947, now seen corresponding path program 3 times [2019-11-28 03:02:43,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:43,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276054193] [2019-11-28 03:02:43,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:02:43,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:02:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:02:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash 64727, now seen corresponding path program 1 times [2019-11-28 03:02:43,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:02:43,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536362227] [2019-11-28 03:02:43,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:02:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:02:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:02:43,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536362227] [2019-11-28 03:02:43,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:02:43,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:02:43,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839207266] [2019-11-28 03:02:43,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:02:43,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:02:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:02:43,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:02:43,498 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. cyclomatic complexity: 18 Second operand 3 states. [2019-11-28 03:02:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:02:43,517 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-11-28 03:02:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:02:43,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2019-11-28 03:02:43,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:02:43,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-11-28 03:02:43,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:02:43,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:02:43,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:02:43,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:02:43,520 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:43,523 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:43,523 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:02:43,523 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:02:43,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:02:43,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:02:43,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:02:43,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:02:43 BoogieIcfgContainer [2019-11-28 03:02:43,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:02:43,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:02:43,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:02:43,534 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:02:43,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:02:31" (3/4) ... [2019-11-28 03:02:43,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:02:43,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:02:43,548 INFO L168 Benchmark]: Toolchain (without parser) took 13510.92 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:43,549 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:43,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:43,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:43,555 INFO L168 Benchmark]: Boogie Preprocessor took 29.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:43,556 INFO L168 Benchmark]: RCFGBuilder took 421.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:43,560 INFO L168 Benchmark]: BuchiAutomizer took 12426.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 274.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:02:43,560 INFO L168 Benchmark]: Witness Printer took 5.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:02:43,563 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12426.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.1 MB). Peak memory consumption was 274.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 * ps + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * ps2 and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString1] + -1 * ps2 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 11.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 107 SDtfs, 102 SDslu, 63 SDs, 0 SdLazy, 105 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital251 mio100 ax107 hnf99 lsp89 ukn85 mio100 lsp39 div100 bol100 ite100 ukn100 eq193 hnf88 smp94 dnf180 smp75 tf100 neg92 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 80ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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! Received shutdown request...