./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/cstrpbrk_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 eec7850a55859668859d25c9503478e74955da1a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:17:31,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:17:31,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:17:31,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:17:31,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:17:31,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:17:31,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:17:31,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:17:31,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:17:31,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:17:31,042 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:17:31,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:17:31,043 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:17:31,044 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:17:31,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:17:31,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:17:31,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:17:31,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:17:31,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:17:31,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:17:31,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:17:31,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:17:31,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:17:31,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:17:31,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:17:31,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:17:31,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:17:31,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:17:31,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:17:31,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:17:31,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:17:31,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:17:31,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:17:31,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:17:31,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:17:31,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:17:31,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:17:31,089 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:17:31,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:17:31,091 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:17:31,091 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:17:31,091 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:17:31,092 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:17:31,092 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:17:31,092 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:17:31,092 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:17:31,092 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:17:31,092 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:17:31,093 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:17:31,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:17:31,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:17:31,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:17:31,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:17:31,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:17:31,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:17:31,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:17:31,096 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:17:31,096 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:17:31,096 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:17:31,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:17:31,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:17:31,097 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:17:31,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:17:31,097 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:17:31,097 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:17:31,099 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:17:31,100 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 -> eec7850a55859668859d25c9503478e74955da1a [2019-01-14 02:17:31,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:17:31,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:17:31,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:17:31,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:17:31,152 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:17:31,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2019-01-14 02:17:31,221 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feed5d283/72b939dcfa924471b58e6dc8f2a03cb8/FLAG49d9f2077 [2019-01-14 02:17:31,711 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:17:31,712 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/cstrpbrk_true-termination_true-no-overflow.c [2019-01-14 02:17:31,720 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feed5d283/72b939dcfa924471b58e6dc8f2a03cb8/FLAG49d9f2077 [2019-01-14 02:17:32,042 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feed5d283/72b939dcfa924471b58e6dc8f2a03cb8 [2019-01-14 02:17:32,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:17:32,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:17:32,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:32,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:17:32,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:17:32,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c0269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32, skipping insertion in model container [2019-01-14 02:17:32,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:17:32,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:17:32,276 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:32,297 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:17:32,318 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:17:32,333 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:17:32,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32 WrapperNode [2019-01-14 02:17:32,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:17:32,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:32,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:17:32,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:17:32,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:17:32,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:17:32,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:17:32,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:17:32,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... [2019-01-14 02:17:32,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:17:32,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:17:32,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:17:32,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:17:32,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:17:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:17:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:17:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:17:32,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:17:32,939 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:17:32,940 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2019-01-14 02:17:32,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:32 BoogieIcfgContainer [2019-01-14 02:17:32,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:17:32,942 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:17:32,942 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:17:32,946 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:17:32,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:32,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:17:32" (1/3) ... [2019-01-14 02:17:32,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6fb7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:32, skipping insertion in model container [2019-01-14 02:17:32,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:32,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:17:32" (2/3) ... [2019-01-14 02:17:32,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6fb7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:17:32, skipping insertion in model container [2019-01-14 02:17:32,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:17:32,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:32" (3/3) ... [2019-01-14 02:17:32,951 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_true-termination_true-no-overflow.c [2019-01-14 02:17:33,012 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:17:33,013 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:17:33,013 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:17:33,013 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:17:33,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:17:33,013 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:17:33,013 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:17:33,014 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:17:33,014 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:17:33,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:17:33,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:17:33,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:33,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:33,061 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,061 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,061 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:17:33,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-01-14 02:17:33,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:17:33,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:33,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:33,065 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,065 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,072 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.base, main_#t~ret12.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; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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.allocOnHeap(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;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L31-4true [2019-01-14 02:17:33,073 INFO L796 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 11#L31-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 9#L34-5true assume !true; 5#L34-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 23#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 4#L31-4true [2019-01-14 02:17:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-01-14 02:17:33,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:33,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:33,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2019-01-14 02:17:33,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:33,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:33,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:17:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:17:33,336 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:17:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:17:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:17:33,355 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-01-14 02:17:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:17:33,363 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-01-14 02:17:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:17:33,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-01-14 02:17:33,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:17:33,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2019-01-14 02:17:33,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:17:33,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 02:17:33,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-14 02:17:33,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:33,378 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:17:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-14 02:17:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:17:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:17:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:17:33,414 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:17:33,415 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:17:33,415 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:17:33,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:17:33,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:17:33,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:33,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:33,420 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,420 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:33,422 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.base, main_#t~ret12.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; 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.allocOnHeap(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.allocOnHeap(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;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 50#L31-4 [2019-01-14 02:17:33,422 INFO L796 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 57#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 61#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 52#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 50#L31-4 [2019-01-14 02:17:33,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:33,423 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2019-01-14 02:17:33,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:33,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2019-01-14 02:17:33,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:33,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2019-01-14 02:17:33,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:33,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:33,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:33,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:33,909 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-14 02:17:34,237 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-01-14 02:17:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:34,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:17:34,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:17:34,854 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 02:17:35,499 WARN L181 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 02:17:35,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:17:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:17:35,501 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-14 02:17:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:17:35,810 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-01-14 02:17:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:17:35,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2019-01-14 02:17:35,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-14 02:17:35,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2019-01-14 02:17:35,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-14 02:17:35,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-14 02:17:35,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2019-01-14 02:17:35,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:35,817 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-14 02:17:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2019-01-14 02:17:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-14 02:17:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 02:17:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-14 02:17:35,821 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 02:17:35,821 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-14 02:17:35,821 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:17:35,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2019-01-14 02:17:35,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-01-14 02:17:35,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:35,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:35,824 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:35,824 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:35,824 INFO L794 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#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.base, main_#t~ret12.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; 131#L14 assume !(build_nondet_String_~length~0 < 1); 138#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 125#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; 126#L14-3 assume !(build_nondet_String_~length~0 < 1); 135#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 122#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 117#L31-4 [2019-01-14 02:17:35,824 INFO L796 eck$LassoCheckResult]: Loop: 117#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 118#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 127#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 136#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 137#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 119#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 120#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 121#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 117#L31-4 [2019-01-14 02:17:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-01-14 02:17:35,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2019-01-14 02:17:35,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2019-01-14 02:17:35,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:36,244 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-01-14 02:17:36,549 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-01-14 02:17:37,087 WARN L181 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-01-14 02:17:37,256 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-14 02:17:37,267 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:37,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:37,269 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:37,269 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:37,269 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:37,269 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:37,269 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:37,270 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:37,270 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration3_Lasso [2019-01-14 02:17:37,270 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:37,270 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:37,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:37,808 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-01-14 02:17:38,054 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-14 02:17:38,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:39,062 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:17:39,285 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-14 02:17:39,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:39,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:39,309 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 [2019-01-14 02:17:39,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,317 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 [2019-01-14 02:17:39,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,320 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 [2019-01-14 02:17:39,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,323 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 [2019-01-14 02:17:39,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,326 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 [2019-01-14 02:17:39,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,332 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 [2019-01-14 02:17:39,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,335 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 [2019-01-14 02:17:39,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,338 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 [2019-01-14 02:17:39,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,340 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 [2019-01-14 02:17:39,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,343 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 [2019-01-14 02:17:39,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,349 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 [2019-01-14 02:17:39,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,351 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 [2019-01-14 02:17:39,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,360 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 [2019-01-14 02:17:39,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,362 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 [2019-01-14 02:17:39,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,372 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 [2019-01-14 02:17:39,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,377 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 [2019-01-14 02:17:39,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,380 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 [2019-01-14 02:17:39,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,388 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 [2019-01-14 02:17:39,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,425 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 [2019-01-14 02:17:39,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,431 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 [2019-01-14 02:17:39,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,432 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:17:39,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,440 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:17:39,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,476 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 [2019-01-14 02:17:39,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:39,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:39,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,480 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 [2019-01-14 02:17:39,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,486 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 [2019-01-14 02:17:39,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,496 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 [2019-01-14 02:17:39,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:39,501 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 [2019-01-14 02:17:39,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:39,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:39,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:39,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:39,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:39,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:39,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:39,544 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:17:39,545 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:17:39,548 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:39,550 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:17:39,550 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:39,551 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2019-01-14 02:17:39,678 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:17:39,688 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:17:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:39,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:39,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:39,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:17:39,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:17:39,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 42 states and 50 transitions. Complement of second has 4 states. [2019-01-14 02:17:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:17:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:17:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-01-14 02:17:39,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2019-01-14 02:17:39,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:39,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2019-01-14 02:17:39,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:39,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2019-01-14 02:17:39,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:39,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2019-01-14 02:17:39,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:39,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 21 states and 27 transitions. [2019-01-14 02:17:39,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:17:39,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:17:39,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-14 02:17:39,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:39,969 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:17:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-14 02:17:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 02:17:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:17:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-14 02:17:39,973 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:17:39,974 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 02:17:39,974 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:17:39,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-01-14 02:17:39,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:39,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:39,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:39,977 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:39,977 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:39,977 INFO L794 eck$LassoCheckResult]: Stem: 305#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 303#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.base, main_#t~ret12.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; 304#L14 assume !(build_nondet_String_~length~0 < 1); 306#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 298#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; 299#L14-3 assume !(build_nondet_String_~length~0 < 1); 300#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 293#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 286#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 288#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 294#L34-5 [2019-01-14 02:17:39,978 INFO L796 eck$LassoCheckResult]: Loop: 294#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 295#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 301#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 294#L34-5 [2019-01-14 02:17:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:39,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2019-01-14 02:17:39,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:39,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:39,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:39,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2019-01-14 02:17:40,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:40,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:40,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:40,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2019-01-14 02:17:40,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:40,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:40,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:40,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:40,175 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:17:40,365 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:17:40,908 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2019-01-14 02:17:41,146 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-14 02:17:41,163 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:41,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:41,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:41,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:41,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:41,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:41,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:41,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:41,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-14 02:17:41,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:41,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:41,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,602 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-14 02:17:41,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17: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 [2019-01-14 02:17:41,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:41,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:42,017 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:17:42,135 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:17:42,961 WARN L181 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:17:43,254 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-14 02:17:43,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:43,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:43,280 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 [2019-01-14 02:17:43,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:43,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:43,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:43,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:43,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:43,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:43,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:43,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:43,286 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 [2019-01-14 02:17:43,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:43,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:43,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:43,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:43,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:43,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:43,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:43,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:43,291 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 [2019-01-14 02:17:43,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:43,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:43,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:43,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:43,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:43,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:43,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:43,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:43,297 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 [2019-01-14 02:17:43,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:43,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:43,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:43,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:43,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:43,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:43,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:43,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:43,301 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 [2019-01-14 02:17:43,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:43,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:43,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:43,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:43,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:43,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:43,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:43,367 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:17:43,367 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:17:43,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:43,369 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:17:43,369 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:43,369 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_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-01-14 02:17:43,601 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-14 02:17:43,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:17:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:44,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:44,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:44,602 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 [2019-01-14 02:17:44,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 02:17:44,698 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 46 states and 59 transitions. Complement of second has 7 states. [2019-01-14 02:17:44,701 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 [2019-01-14 02:17:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:17:44,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 02:17:44,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:44,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-14 02:17:44,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:17:44,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:44,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2019-01-14 02:17:44,706 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:44,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 33 states and 42 transitions. [2019-01-14 02:17:44,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:17:44,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:17:44,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-01-14 02:17:44,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:44,707 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-01-14 02:17:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-01-14 02:17:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-01-14 02:17:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:17:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-14 02:17:44,713 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 02:17:44,713 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-14 02:17:44,714 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:17:44,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-01-14 02:17:44,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:44,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:44,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:44,715 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:44,716 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:44,718 INFO L794 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 480#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.base, main_#t~ret12.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; 481#L14 assume !(build_nondet_String_~length~0 < 1); 484#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 474#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; 475#L14-3 assume !(build_nondet_String_~length~0 < 1); 477#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 469#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 461#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 462#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 476#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 483#L34-1 assume !cstrpbrk_#t~short7; 479#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 466#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 467#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 468#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 463#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 464#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 470#L34-5 [2019-01-14 02:17:44,719 INFO L796 eck$LassoCheckResult]: Loop: 470#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 471#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 478#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 470#L34-5 [2019-01-14 02:17:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2019-01-14 02:17:44,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:44,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:44,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:45,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:17:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 02:17:45,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:17:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:45,284 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2019-01-14 02:17:45,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:45,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:17:45,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,571 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:17:45,708 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:17:45,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:17:45,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:17:45,710 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-01-14 02:17:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:17:45,817 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-01-14 02:17:45,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:17:45,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2019-01-14 02:17:45,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:17:45,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 37 transitions. [2019-01-14 02:17:45,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:17:45,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:17:45,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-14 02:17:45,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:17:45,823 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 02:17:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-14 02:17:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-14 02:17:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:17:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-14 02:17:45,826 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 02:17:45,826 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 02:17:45,826 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:17:45,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-01-14 02:17:45,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:17:45,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:17:45,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:17:45,827 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:17:45,827 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:17:45,828 INFO L794 eck$LassoCheckResult]: Stem: 560#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 558#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.base, main_#t~ret12.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; 559#L14 assume !(build_nondet_String_~length~0 < 1); 561#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 553#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; 554#L14-3 assume !(build_nondet_String_~length~0 < 1); 555#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(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; 547#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 539#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 540#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 550#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 551#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 562#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6; 544#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 545#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 546#L31-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 541#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 542#L31-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 548#L34-5 [2019-01-14 02:17:45,828 INFO L796 eck$LassoCheckResult]: Loop: 548#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 549#L34-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 556#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 548#L34-5 [2019-01-14 02:17:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2019-01-14 02:17:45,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:45,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2019-01-14 02:17:45,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2019-01-14 02:17:45,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:17:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:17:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:17:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:17:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:17:46,116 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-14 02:17:46,242 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:17:47,084 WARN L181 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 156 [2019-01-14 02:17:48,243 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-01-14 02:17:48,246 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:17:48,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:17:48,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:17:48,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:17:48,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:17:48,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:17:48,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:17:48,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:17:48,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_true-termination_true-no-overflow.c_Iteration6_Lasso [2019-01-14 02:17:48,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:17:48,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:17:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:48,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:17:49,374 WARN L181 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2019-01-14 02:17:49,523 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 02:17:49,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:49,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:49,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:17:50,275 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-01-14 02:17:50,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:17:55,285 WARN L181 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 143 DAG size of output: 90 [2019-01-14 02:17:55,804 WARN L181 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-01-14 02:17:55,846 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:17:55,847 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:17:55,848 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 [2019-01-14 02:17:55,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,855 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 [2019-01-14 02:17:55,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,861 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 [2019-01-14 02:17:55,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,866 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 [2019-01-14 02:17:55,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,872 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 [2019-01-14 02:17:55,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:55,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:55,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,880 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 [2019-01-14 02:17:55,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,882 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 [2019-01-14 02:17:55,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,886 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 [2019-01-14 02:17:55,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,894 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 [2019-01-14 02:17:55,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,895 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 [2019-01-14 02:17:55,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:55,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:55,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,908 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 [2019-01-14 02:17:55,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,913 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 [2019-01-14 02:17:55,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,916 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 [2019-01-14 02:17:55,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,917 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 [2019-01-14 02:17:55,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,924 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 [2019-01-14 02:17:55,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:17:55,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:17:55,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:17:55,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,927 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 [2019-01-14 02:17:55,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:55,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:55,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:17:55,937 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 [2019-01-14 02:17:55,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:17:55,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:17:55,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:17:55,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:17:55,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:17:55,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:17:55,971 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:17:56,000 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:17:56,004 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:17:56,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:17:56,006 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:17:56,007 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:17:56,007 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 Supporting invariants [] [2019-01-14 02:17:56,188 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2019-01-14 02:17:56,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:17:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:56,403 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 [2019-01-14 02:17:56,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:17:56,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 44 states and 53 transitions. Complement of second has 7 states. [2019-01-14 02:17:56,481 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 [2019-01-14 02:17:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:17:56,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:17:56,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:56,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:56,578 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 [2019-01-14 02:17:56,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:17:56,663 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 44 states and 53 transitions. Complement of second has 7 states. [2019-01-14 02:17:56,666 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 [2019-01-14 02:17:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:17:56,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:17:56,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:56,667 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:17:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:17:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:17:56,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:17:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:17:56,773 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 [2019-01-14 02:17:56,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:17:56,847 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 44 states and 55 transitions. Complement of second has 6 states. [2019-01-14 02:17:56,850 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 [2019-01-14 02:17:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:17:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2019-01-14 02:17:56,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:17:56,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:56,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-14 02:17:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:56,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-14 02:17:56,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:17:56,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-14 02:17:56,859 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:56,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-01-14 02:17:56,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:17:56,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:17:56,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:17:56,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:17:56,860 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:56,860 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:56,860 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:17:56,860 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:17:56,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:17:56,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:17:56,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:17:56,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:17:56 BoogieIcfgContainer [2019-01-14 02:17:56,878 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:17:56,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:17:56,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:17:56,878 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:17:56,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:17:32" (3/4) ... [2019-01-14 02:17:56,887 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:17:56,889 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:17:56,891 INFO L168 Benchmark]: Toolchain (without parser) took 24844.53 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 427.3 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -369.8 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:56,893 INFO L168 Benchmark]: CDTParser took 0.24 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. [2019-01-14 02:17:56,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:56,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:56,896 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:56,897 INFO L168 Benchmark]: RCFGBuilder took 537.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:56,901 INFO L168 Benchmark]: BuchiAutomizer took 23935.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 283.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.7 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:17:56,904 INFO L168 Benchmark]: Witness Printer took 10.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:17:56,911 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.24 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 285.35 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 39.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 537.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23935.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 283.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.7 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. * Witness Printer took 10.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 23.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 21.2s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. 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, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 133 SDtfs, 156 SDslu, 143 SDs, 0 SdLazy, 204 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp47 div122 bol100 ite100 ukn100 eq170 hnf85 smp83 dnf1593 smp45 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 11 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...