./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:23:43,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:23:43,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:23:43,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:23:43,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:23:43,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:23:43,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:23:43,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:23:43,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:23:43,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:23:43,337 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:23:43,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:23:43,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:23:43,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:23:43,340 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:23:43,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:23:43,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:23:43,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:23:43,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:23:43,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:23:43,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:23:43,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:23:43,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:23:43,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:23:43,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:23:43,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:23:43,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:23:43,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:23:43,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:23:43,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:23:43,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:23:43,367 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:23:43,367 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:23:43,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:23:43,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:23:43,369 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:23:43,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:23:43,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:23:43,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:23:43,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:23:43,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:23:43,399 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:23:43,400 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:23:43,400 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:23:43,400 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:23:43,400 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:23:43,400 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:23:43,401 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:23:43,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:23:43,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:23:43,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:23:43,403 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:23:43,403 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:23:43,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:23:43,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:23:43,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:23:43,405 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:23:43,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:23:43,405 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:23:43,405 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:23:43,407 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:23:43,407 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 -> c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 [2018-11-28 23:23:43,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:23:43,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:23:43,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:23:43,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:23:43,480 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:23:43,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-28 23:23:43,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaeac36e/69e02f77e76c425d90e917ed7dfbb307/FLAG50ec62fe1 [2018-11-28 23:23:44,136 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:23:44,137 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-28 23:23:44,153 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaeac36e/69e02f77e76c425d90e917ed7dfbb307/FLAG50ec62fe1 [2018-11-28 23:23:44,365 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaeac36e/69e02f77e76c425d90e917ed7dfbb307 [2018-11-28 23:23:44,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:23:44,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:23:44,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:44,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:23:44,375 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:23:44,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:44" (1/1) ... [2018-11-28 23:23:44,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5728d7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:44, skipping insertion in model container [2018-11-28 23:23:44,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:23:44" (1/1) ... [2018-11-28 23:23:44,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:23:44,437 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:23:44,886 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:44,902 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:23:45,066 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:23:45,140 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:23:45,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45 WrapperNode [2018-11-28 23:23:45,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:23:45,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:45,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:23:45,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:23:45,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:23:45,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:23:45,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:23:45,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:23:45,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... [2018-11-28 23:23:45,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:23:45,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:23:45,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:23:45,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:23:45,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:23:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:23:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:23:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:23:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:23:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:23:45,808 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:23:45,808 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:23:45,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:45 BoogieIcfgContainer [2018-11-28 23:23:45,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:23:45,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:23:45,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:23:45,814 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:23:45,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:45,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:23:44" (1/3) ... [2018-11-28 23:23:45,816 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b24f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:45, skipping insertion in model container [2018-11-28 23:23:45,816 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:45,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:23:45" (2/3) ... [2018-11-28 23:23:45,817 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b24f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:23:45, skipping insertion in model container [2018-11-28 23:23:45,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:23:45,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:45" (3/3) ... [2018-11-28 23:23:45,819 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-28 23:23:45,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:23:45,879 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:23:45,880 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:23:45,880 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:23:45,880 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:23:45,880 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:23:45,880 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:23:45,880 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:23:45,881 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:23:45,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:45,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:45,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:45,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:45,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:45,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:45,930 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:23:45,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:23:45,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:45,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:45,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:45,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:45,933 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:23:45,943 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 6#L369-4true [2018-11-28 23:23:45,943 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2018-11-28 23:23:45,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-28 23:23:45,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:46,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-11-28 23:23:46,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:46,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:46,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:23:46,189 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:23:46,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:23:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:23:46,211 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 23:23:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:46,220 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-11-28 23:23:46,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:23:46,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-11-28 23:23:46,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:46,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-11-28 23:23:46,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:23:46,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:23:46,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-28 23:23:46,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:23:46,232 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-28 23:23:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-28 23:23:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:23:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-28 23:23:46,262 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:46,262 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-28 23:23:46,262 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:23:46,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-28 23:23:46,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:23:46,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:46,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:46,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:23:46,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:46,265 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 47#L369-4 [2018-11-28 23:23:46,265 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2018-11-28 23:23:46,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-28 23:23:46,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:46,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-11-28 23:23:46,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:46,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:46,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-11-28 23:23:46,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:46,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:46,946 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-28 23:23:48,020 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-28 23:23:48,360 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2018-11-28 23:23:48,543 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-28 23:23:48,557 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:48,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:48,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:48,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:48,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:48,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:48,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:48,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:48,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:23:48,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:48,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:48,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:48,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:49,167 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-28 23:23:49,445 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-28 23:23:49,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:49,691 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:23:50,645 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-28 23:23:50,743 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:50,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:50,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:50,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:50,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:50,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:50,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:23:50,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:23:50,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:23:50,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,825 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:50,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,830 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:50,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:50,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:50,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:50,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:50,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:50,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:50,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:50,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:50,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:50,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:50,992 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:23:50,993 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:23:50,996 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:50,998 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:50,998 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:50,999 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-28 23:23:51,169 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 23:23:51,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:23:51,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:51,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:51,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:51,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:23:51,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:23:51,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-11-28 23:23:51,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-11-28 23:23:51,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:23:51,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:51,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-28 23:23:51,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:51,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-11-28 23:23:51,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:51,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 23:23:51,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:51,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-11-28 23:23:51,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:23:51,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:23:51,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-11-28 23:23:51,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:51,530 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-11-28 23:23:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 23:23:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:23:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 23:23:51,532 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:51,532 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:23:51,532 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:23:51,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 23:23:51,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:51,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:51,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:51,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:51,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:51,534 INFO L794 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 183#L382 assume !(main_~length1~0 < 1); 184#L382-2 assume !(main_~length2~0 < 1); 181#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 178#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 180#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 190#L372-5 [2018-11-28 23:23:51,534 INFO L796 eck$LassoCheckResult]: Loop: 190#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 185#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 186#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 190#L372-5 [2018-11-28 23:23:51,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-28 23:23:51,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:51,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-28 23:23:51,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:51,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-11-28 23:23:51,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:51,880 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 23:23:52,022 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-28 23:23:52,377 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-11-28 23:23:52,539 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 23:23:52,544 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:52,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:52,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:52,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:52,544 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:52,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:52,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:52,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:52,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:23:52,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:52,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:52,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:52,958 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2018-11-28 23:23:53,094 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-28 23:23:53,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:53,494 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:23:53,876 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:23:54,061 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-28 23:23:54,145 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:23:54,145 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:23:54,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,156 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:54,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:54,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,177 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:54,177 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 23:23:54,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,208 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-28 23:23:54,208 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 23:23:54,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,328 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:23:54,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,330 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:23:54,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:23:54,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:23:54,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:23:54,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:23:54,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:23:54,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:23:54,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:23:54,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:23:54,401 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:23:54,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:23:54,431 INFO L444 ModelExtractionUtils]: 49 out of 52 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:23:54,434 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:23:54,435 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:23:54,436 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:23:54,436 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2018-11-28 23:23:54,643 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:23:54,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:54,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:54,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:23:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:54,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:23:54,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:23:54,812 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2018-11-28 23:23:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:23:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:23:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-28 23:23:54,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:23:54,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:23:54,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:23:54,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:23:54,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-28 23:23:54,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:54,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-11-28 23:23:54,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:23:54,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:54,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-11-28 23:23:54,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:54,825 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-11-28 23:23:54,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-11-28 23:23:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-11-28 23:23:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:23:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-28 23:23:54,832 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 23:23:54,832 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-28 23:23:54,832 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:23:54,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-28 23:23:54,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:54,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:54,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:54,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:54,836 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:54,837 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 359#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 360#L382 assume !(main_~length1~0 < 1); 361#L382-2 assume !(main_~length2~0 < 1); 358#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 354#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 355#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 368#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 364#L372-1 assume !cstrpbrk_#t~short210; 365#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 350#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 351#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 352#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 353#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 357#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 367#L372-5 [2018-11-28 23:23:54,837 INFO L796 eck$LassoCheckResult]: Loop: 367#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 362#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 363#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 367#L372-5 [2018-11-28 23:23:54,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-11-28 23:23:54,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:54,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:54,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:54,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:23:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:23:55,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:23:55,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:23:55,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:23:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-28 23:23:55,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:23:55,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:55,775 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 23:23:55,892 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-28 23:23:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:23:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:23:55,894 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:23:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:23:55,984 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-11-28 23:23:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:23:55,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-11-28 23:23:55,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:23:55,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-11-28 23:23:55,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:23:55,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:23:55,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-11-28 23:23:55,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:23:55,987 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:23:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-11-28 23:23:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-28 23:23:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:23:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-28 23:23:55,991 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-28 23:23:55,991 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-28 23:23:55,991 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:23:55,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-28 23:23:55,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:23:55,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:23:55,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:23:55,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:23:55,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:23:55,993 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 431#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 432#L382 assume !(main_~length1~0 < 1); 433#L382-2 assume !(main_~length2~0 < 1); 430#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, 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; 426#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 427#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 440#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 444#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 443#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208; 422#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 423#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 424#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 425#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 429#L369-1 assume !!(0 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 439#L372-5 [2018-11-28 23:23:55,993 INFO L796 eck$LassoCheckResult]: Loop: 439#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 0 != cstrpbrk_#t~mem208; 435#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 436#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 439#L372-5 [2018-11-28 23:23:55,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-11-28 23:23:55,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:55,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:55,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:55,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-28 23:23:56,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:23:56,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-11-28 23:23:56,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:23:56,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:23:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:23:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:23:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:23:56,188 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-28 23:23:56,302 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-28 23:23:57,018 WARN L180 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2018-11-28 23:23:57,970 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-11-28 23:23:57,973 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:23:57,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:23:57,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:23:57,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:23:57,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:23:57,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:23:57,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:23:57,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:23:57,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:23:57,974 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:23:57,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:23:57,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:58,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:23:59,332 WARN L180 SmtUtils]: Spent 864.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-11-28 23:23:59,473 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-28 23:23:59,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:23:59,846 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-28 23:24:00,806 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-28 23:24:01,003 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-28 23:24:01,015 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:01,016 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:01,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:01,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:01,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:01,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,070 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:01,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,075 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:01,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:01,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,104 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:01,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:01,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:01,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:01,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:01,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:01,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:01,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:01,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:01,146 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:01,162 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:24:01,162 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:24:01,163 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:01,165 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:01,165 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:01,165 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 Supporting invariants [] [2018-11-28 23:24:01,499 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-28 23:24:01,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:24:01,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:01,639 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:24:01,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:01,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-28 23:24:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:24:01,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:01,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:01,708 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:01,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:01,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:24:01,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:01,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-28 23:24:01,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:24:01,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:01,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:01,885 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:01,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:01,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:01,975 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:24:01,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-28 23:24:02,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-11-28 23:24:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:24:02,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-28 23:24:02,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:02,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 23:24:02,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:02,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 23:24:02,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:02,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-11-28 23:24:02,046 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:02,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-28 23:24:02,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:02,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:02,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:02,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:02,047 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:02,047 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:02,047 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:02,047 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:02,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:02,047 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:02,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:02,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:02 BoogieIcfgContainer [2018-11-28 23:24:02,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:02,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:02,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:02,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:02,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:23:45" (3/4) ... [2018-11-28 23:24:02,060 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:02,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:02,061 INFO L168 Benchmark]: Toolchain (without parser) took 17692.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 951.3 MB in the beginning and 860.7 MB in the end (delta: 90.7 MB). Peak memory consumption was 410.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:02,063 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:02,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:02,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:02,065 INFO L168 Benchmark]: Boogie Preprocessor took 34.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:02,065 INFO L168 Benchmark]: RCFGBuilder took 572.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:02,066 INFO L168 Benchmark]: BuchiAutomizer took 16245.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 860.7 MB in the end (delta: 227.4 MB). Peak memory consumption was 414.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:02,067 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.3 GB. Free memory is still 860.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:02,071 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.15 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 769.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 572.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16245.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 860.7 MB in the end (delta: 227.4 MB). Peak memory consumption was 414.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.3 GB. Free memory is still 860.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 114 SDslu, 68 SDs, 0 SdLazy, 100 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital368 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp37 div117 bol100 ite100 ukn100 eq177 hnf83 smp92 dnf605 smp26 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 145ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...