./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0c74f0cc26425c1a044a70e86941b5dd82b132ff ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:15:32,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:15:32,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:15:32,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:15:32,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:15:32,194 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:15:32,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:15:32,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:15:32,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:15:32,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:15:32,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:15:32,213 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:15:32,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:15:32,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:15:32,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:15:32,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:15:32,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:15:32,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:15:32,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:15:32,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:15:32,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:15:32,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:15:32,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:15:32,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:15:32,253 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:15:32,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:15:32,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:15:32,259 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:15:32,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:15:32,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:15:32,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:15:32,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:15:32,268 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:15:32,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:15:32,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:15:32,272 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:15:32,274 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:15:32,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:15:32,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:15:32,298 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:15:32,298 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:15:32,298 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:15:32,299 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:15:32,299 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:15:32,299 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:15:32,299 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:15:32,299 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:15:32,300 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:15:32,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:15:32,301 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:15:32,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:15:32,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:15:32,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:15:32,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:15:32,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:15:32,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:15:32,303 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:15:32,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:15:32,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:15:32,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:15:32,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:15:32,304 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:15:32,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:15:32,304 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:15:32,304 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:15:32,307 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:15:32,307 INFO L133 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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2018-11-28 23:15:32,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:15:32,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:15:32,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:15:32,368 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:15:32,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:15:32,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-11-28 23:15:32,443 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc634708/457849415e8a4a15b9f9fc1cdef038b6/FLAG1b8ceeed3 [2018-11-28 23:15:32,916 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:15:32,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-11-28 23:15:32,924 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc634708/457849415e8a4a15b9f9fc1cdef038b6/FLAG1b8ceeed3 [2018-11-28 23:15:33,297 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc634708/457849415e8a4a15b9f9fc1cdef038b6 [2018-11-28 23:15:33,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:15:33,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:15:33,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:15:33,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:15:33,309 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:15:33,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f138209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33, skipping insertion in model container [2018-11-28 23:15:33,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:15:33,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:15:33,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:15:33,563 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:15:33,586 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:15:33,604 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:15:33,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33 WrapperNode [2018-11-28 23:15:33,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:15:33,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:15:33,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:15:33,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:15:33,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:15:33,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:15:33,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:15:33,669 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:15:33,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (1/1) ... [2018-11-28 23:15:33,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:15:33,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:15:33,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:15:33,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:15:33,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (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 [2018-11-28 23:15:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:15:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:15:33,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:15:33,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:15:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:15:34,316 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:15:34,316 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-28 23:15:34,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:34 BoogieIcfgContainer [2018-11-28 23:15:34,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:15:34,318 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:15:34,318 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:15:34,323 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:15:34,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:34,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:15:33" (1/3) ... [2018-11-28 23:15:34,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8f1e9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:15:34, skipping insertion in model container [2018-11-28 23:15:34,325 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:34,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:15:33" (2/3) ... [2018-11-28 23:15:34,326 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8f1e9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:15:34, skipping insertion in model container [2018-11-28 23:15:34,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:15:34,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:34" (3/3) ... [2018-11-28 23:15:34,328 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_true-termination_true-no-overflow.c [2018-11-28 23:15:34,387 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:15:34,388 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:15:34,388 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:15:34,388 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:15:34,388 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:15:34,389 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:15:34,389 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:15:34,389 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:15:34,389 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:15:34,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:15:34,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:15:34,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:34,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:34,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,436 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:15:34,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 23:15:34,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:15:34,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:34,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:34,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,447 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L31-4true [2018-11-28 23:15:34,448 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 23#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-4true [2018-11-28 23:15:34,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-28 23:15:34,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:34,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:34,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-11-28 23:15:34,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:34,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:34,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:34,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:15:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:15:34,684 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:15:34,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:15:34,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:15:34,706 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-28 23:15:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:15:34,716 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-28 23:15:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:15:34,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-28 23:15:34,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:15:34,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-11-28 23:15:34,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:15:34,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:15:34,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 23:15:34,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:34,729 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:15:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 23:15:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:15:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:15:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 23:15:34,762 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:15:34,762 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:15:34,762 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:15:34,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 23:15:34,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:15:34,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:34,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:34,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:34,765 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 50#L31-4 [2018-11-28 23:15:34,765 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 57#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 61#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 52#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 53#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 54#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 50#L31-4 [2018-11-28 23:15:34,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-28 23:15:34,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:34,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-11-28 23:15:34,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:34,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:34,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-11-28 23:15:34,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:35,465 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-11-28 23:15:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:35,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:15:35,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:15:36,122 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 23:15:36,804 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-28 23:15:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:15:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:15:36,807 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 23:15:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:15:37,150 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-28 23:15:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:15:37,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-28 23:15:37,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 23:15:37,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 23:15:37,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 23:15:37,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 23:15:37,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-28 23:15:37,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:37,160 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 23:15:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-28 23:15:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-28 23:15:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:15:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-28 23:15:37,164 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 23:15:37,164 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 23:15:37,164 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:15:37,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-28 23:15:37,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 23:15:37,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:37,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:37,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:37,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:37,170 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 126#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 127#L14-3 assume !(build_nondet_String_~length~0 < 1); 129#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 130#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 142#L31-4 [2018-11-28 23:15:37,170 INFO L796 eck$LassoCheckResult]: Loop: 142#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 141#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 124#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 125#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 138#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 139#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 144#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 143#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 142#L31-4 [2018-11-28 23:15:37,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-28 23:15:37,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:37,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2018-11-28 23:15:37,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:37,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:37,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2018-11-28 23:15:37,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:37,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:37,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:37,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:37,631 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 23:15:37,940 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-28 23:15:38,410 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-11-28 23:15:38,554 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 23:15:38,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:38,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:38,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:38,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:38,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:38,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:38,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:38,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:38,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-28 23:15:38,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:38,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:38,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:38,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,090 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-11-28 23:15:39,286 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 23:15:39,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:39,827 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-28 23:15:39,979 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:39,984 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:39,986 INFO L122 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 [2018-11-28 23:15:39,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:39,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:39,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:39,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:39,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:39,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:39,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:39,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:39,994 INFO L122 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 [2018-11-28 23:15:39,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:39,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:39,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:39,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:39,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:39,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:39,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:39,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:39,997 INFO L122 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 [2018-11-28 23:15:39,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:39,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:39,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:39,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:39,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:39,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:39,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:39,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:39,999 INFO L122 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 [2018-11-28 23:15:40,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:40,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:40,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:40,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:40,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:40,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:40,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:40,006 INFO L122 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 [2018-11-28 23:15:40,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:40,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:40,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:40,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:40,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:40,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:40,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:40,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:40,009 INFO L122 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 [2018-11-28 23:15:40,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:40,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:40,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:40,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:40,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:40,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:40,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:40,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:40,011 INFO L122 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 [2018-11-28 23:15:40,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:40,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:40,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:40,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:40,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:40,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:40,052 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:40,102 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:15:40,102 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:15:40,105 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:40,108 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:15:40,109 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:40,111 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-11-28 23:15:40,184 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:15:40,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:15:40,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:40,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:40,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:40,367 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 [2018-11-28 23:15:40,368 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:15:40,455 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-28 23:15:40,456 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 [2018-11-28 23:15:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-28 23:15:40,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-28 23:15:40,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:40,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-28 23:15:40,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:40,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-28 23:15:40,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:40,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-28 23:15:40,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:40,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-11-28 23:15:40,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:15:40,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:15:40,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 23:15:40,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:40,466 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:15:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 23:15:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 23:15:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:15:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 23:15:40,468 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:15:40,469 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 23:15:40,469 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:15:40,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 23:15:40,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:40,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:40,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:40,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:40,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:15:40,471 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 304#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 297#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 290#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 292#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 298#L34-5 [2018-11-28 23:15:40,471 INFO L796 eck$LassoCheckResult]: Loop: 298#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 299#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 305#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 298#L34-5 [2018-11-28 23:15:40,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-28 23:15:40,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:40,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:40,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-11-28 23:15:40,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:40,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-11-28 23:15:40,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:40,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:40,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:40,739 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:15:40,865 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 23:15:41,427 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2018-11-28 23:15:41,569 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 23:15:41,572 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:41,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:41,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:41,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:41,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:41,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:41,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:41,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:41,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 23:15:41,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:41,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:41,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:41,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,097 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-11-28 23:15:42,287 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-11-28 23:15:42,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:42,812 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-11-28 23:15:43,454 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:15:43,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:43,618 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:43,619 INFO L122 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 [2018-11-28 23:15:43,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,625 INFO L122 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 [2018-11-28 23:15:43,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,630 INFO L122 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 [2018-11-28 23:15:43,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,636 INFO L122 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 [2018-11-28 23:15:43,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,641 INFO L122 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 [2018-11-28 23:15:43,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,647 INFO L122 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 [2018-11-28 23:15:43,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,656 INFO L122 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 [2018-11-28 23:15:43,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,661 INFO L122 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 [2018-11-28 23:15:43,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:43,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:43,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:43,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,668 INFO L122 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 [2018-11-28 23:15:43,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,669 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:15:43,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,675 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:15:43,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,693 INFO L122 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 [2018-11-28 23:15:43,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,707 INFO L122 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 [2018-11-28 23:15:43,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,726 INFO L122 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 [2018-11-28 23:15:43,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,739 INFO L122 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 [2018-11-28 23:15:43,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,749 INFO L122 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 [2018-11-28 23:15:43,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,752 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:15:43,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,757 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:15:43,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,774 INFO L122 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 [2018-11-28 23:15:43,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,775 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:15:43,775 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:15:43,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,819 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-28 23:15:43,819 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 23:15:43,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:43,955 INFO L122 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 [2018-11-28 23:15:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:43,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:43,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:43,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:43,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:43,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:43,982 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:44,030 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:15:44,030 INFO L444 ModelExtractionUtils]: 46 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:15:44,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:44,032 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:15:44,033 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:44,033 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-28 23:15:44,243 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:15:44,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:15:44,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:44,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:44,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:44,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 23:15:44,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:15:44,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-11-28 23:15:44,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:15:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 23:15:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:15:44,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 23:15:44,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:44,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:15:44,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:44,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-28 23:15:44,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:44,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-11-28 23:15:44,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:15:44,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:15:44,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-28 23:15:44,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:44,549 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 23:15:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-28 23:15:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-28 23:15:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:15:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 23:15:44,552 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:15:44,552 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 23:15:44,552 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:15:44,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 23:15:44,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:44,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:44,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:44,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:44,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:15:44,555 INFO L794 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 497#L14 assume !(build_nondet_String_~length~0 < 1); 500#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 490#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 491#L14-3 assume !(build_nondet_String_~length~0 < 1); 493#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 485#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 477#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 478#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 492#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 499#L34-1 assume !cstrspn_#t~short7; 495#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 482#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 483#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 484#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 479#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 481#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 486#L34-5 [2018-11-28 23:15:44,555 INFO L796 eck$LassoCheckResult]: Loop: 486#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 487#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 494#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 486#L34-5 [2018-11-28 23:15:44,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2018-11-28 23:15:44,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:44,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:45,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:15:45,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:15:45,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:15:45,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:45,105 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-11-28 23:15:45,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:45,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:45,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:15:45,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,242 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:15:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:15:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:15:45,359 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 23:15:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:15:45,516 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-28 23:15:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:15:45,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-28 23:15:45,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:45,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2018-11-28 23:15:45,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:15:45,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:15:45,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-28 23:15:45,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:45,520 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 23:15:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-28 23:15:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 23:15:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:15:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-28 23:15:45,524 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 23:15:45,524 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 23:15:45,524 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:15:45,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-28 23:15:45,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:45,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:45,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:45,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:45,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:15:45,526 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 569#L14 assume !(build_nondet_String_~length~0 < 1); 576#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 565#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 566#L14-3 assume !(build_nondet_String_~length~0 < 1); 567#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 560#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 552#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 553#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 572#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 574#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 575#L34-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 557#L34-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 558#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 559#L31-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 554#L31-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 556#L31-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 561#L34-5 [2018-11-28 23:15:45,526 INFO L796 eck$LassoCheckResult]: Loop: 561#L34-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 562#L34-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 570#L34-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 561#L34-5 [2018-11-28 23:15:45,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2018-11-28 23:15:45,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:45,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-11-28 23:15:45,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:45,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:45,597 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-11-28 23:15:45,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:45,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:46,436 WARN L180 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-28 23:15:46,718 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-28 23:15:47,447 WARN L180 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 153 [2018-11-28 23:15:48,476 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2018-11-28 23:15:48,481 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:48,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:48,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:48,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:48,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:48,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:48,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:48,482 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:48,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-28 23:15:48,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:48,482 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:48,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:48,770 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:15:49,578 WARN L180 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-11-28 23:15:49,711 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 23:15:49,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:49,950 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-28 23:15:50,323 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:15:50,751 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-28 23:15:50,972 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:15:51,241 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:51,242 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:51,242 INFO L122 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 [2018-11-28 23:15:51,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:51,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:51,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:51,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,250 INFO L122 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 [2018-11-28 23:15:51,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:51,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,257 INFO L122 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 [2018-11-28 23:15:51,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:51,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:51,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:51,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,263 INFO L122 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 [2018-11-28 23:15:51,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:51,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:51,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:51,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,268 INFO L122 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 [2018-11-28 23:15:51,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:51,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:51,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:51,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,273 INFO L122 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 [2018-11-28 23:15:51,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:51,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:51,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:51,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,278 INFO L122 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 [2018-11-28 23:15:51,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,278 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-28 23:15:51,278 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:15:51,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,311 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-28 23:15:51,311 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 23:15:51,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,429 INFO L122 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 [2018-11-28 23:15:51,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:51,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,437 INFO L122 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 [2018-11-28 23:15:51,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,437 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:15:51,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:15:51,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,446 INFO L122 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 [2018-11-28 23:15:51,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:51,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,453 INFO L122 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 [2018-11-28 23:15:51,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,454 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:15:51,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,458 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:15:51,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,466 INFO L122 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 [2018-11-28 23:15:51,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:51,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:51,474 INFO L122 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 [2018-11-28 23:15:51,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:51,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:51,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:51,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:51,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:51,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:51,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:51,517 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:15:51,517 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:15:51,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:51,519 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:15:51,519 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:51,519 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2018-11-28 23:15:51,967 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 23:15:51,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:15:52,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:52,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 23:15:52,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:15:52,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-28 23:15:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:15:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:15:52,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:15:52,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:52,425 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:52,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:52,531 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 23:15:52,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:15:52,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 43 states and 48 transitions. Complement of second has 7 states. [2018-11-28 23:15:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:15:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:15:52,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:15:52,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:52,617 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:52,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:52,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:52,767 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 23:15:52,768 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 23:15:52,841 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 42 states and 48 transitions. Complement of second has 6 states. [2018-11-28 23:15:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:15:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-28 23:15:52,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:15:52,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:52,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 23:15:52,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:52,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-28 23:15:52,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:52,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 48 transitions. [2018-11-28 23:15:52,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:52,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2018-11-28 23:15:52,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:15:52,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:15:52,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:15:52,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:52,850 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:52,850 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:52,850 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:52,850 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:15:52,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:15:52,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:52,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:15:52,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:15:52 BoogieIcfgContainer [2018-11-28 23:15:52,862 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:15:52,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:15:52,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:15:52,863 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:15:52,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:15:34" (3/4) ... [2018-11-28 23:15:52,869 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:15:52,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:15:52,870 INFO L168 Benchmark]: Toolchain (without parser) took 19569.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -231.0 MB). Peak memory consumption was 118.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:52,872 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:52,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:52,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.13 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:52,875 INFO L168 Benchmark]: Boogie Preprocessor took 54.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:52,877 INFO L168 Benchmark]: RCFGBuilder took 593.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:52,878 INFO L168 Benchmark]: BuchiAutomizer took 18544.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.4 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:52,880 INFO L168 Benchmark]: Witness Printer took 6.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:52,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.50 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.13 ms. Allocated memory is still 1.0 GB. Free memory is still 941.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 593.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18544.44 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -99.4 MB). Peak memory consumption was 133.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 16.3s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 129 SDtfs, 147 SDslu, 143 SDs, 0 SdLazy, 203 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp33 div137 bol100 ite100 ukn100 eq168 hnf75 smp88 dnf717 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 150ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...