./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-memory-alloca/cstrcspn-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 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:49:17,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:49:17,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:49:17,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:49:17,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:49:17,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:49:17,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:49:17,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:49:17,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:49:17,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:49:17,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:49:17,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:49:17,278 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:49:17,279 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:49:17,280 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:49:17,281 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:49:17,282 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:49:17,284 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:49:17,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:49:17,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:49:17,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:49:17,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:49:17,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:49:17,292 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:49:17,292 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:49:17,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:49:17,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:49:17,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:49:17,296 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:49:17,297 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:49:17,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:49:17,298 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:49:17,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:49:17,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:49:17,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:49:17,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:49:17,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:49:17,317 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:49:17,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:49:17,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:49:17,318 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:49:17,319 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:49:17,319 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:49:17,319 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:49:17,319 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:49:17,319 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:49:17,319 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:49:17,320 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:49:17,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:49:17,320 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:49:17,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:49:17,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:49:17,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:49:17,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:49:17,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:49:17,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:49:17,322 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:49:17,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:49:17,322 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:49:17,323 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:49:17,323 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:49:17,324 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 -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2019-01-01 21:49:17,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:49:17,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:49:17,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:49:17,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:49:17,410 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:49:17,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2019-01-01 21:49:17,472 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adafe8cac/621dcd28ff874ef29d2abefc87e333f3/FLAGeb3aed98b [2019-01-01 21:49:17,990 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:49:17,993 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2019-01-01 21:49:18,011 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adafe8cac/621dcd28ff874ef29d2abefc87e333f3/FLAGeb3aed98b [2019-01-01 21:49:18,271 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adafe8cac/621dcd28ff874ef29d2abefc87e333f3 [2019-01-01 21:49:18,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:49:18,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:49:18,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:18,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:49:18,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:49:18,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:18" (1/1) ... [2019-01-01 21:49:18,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c28cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:18, skipping insertion in model container [2019-01-01 21:49:18,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:18" (1/1) ... [2019-01-01 21:49:18,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:49:18,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:49:18,790 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:18,802 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:49:18,877 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:19,043 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:49:19,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19 WrapperNode [2019-01-01 21:49:19,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:19,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:19,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:49:19,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:49:19,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:19,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:49:19,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:49:19,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:49:19,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... [2019-01-01 21:49:19,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:49:19,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:49:19,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:49:19,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:49:19,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:49:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:49:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:49:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:49:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:49:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:49:19,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:49:19,721 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:49:19,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:19 BoogieIcfgContainer [2019-01-01 21:49:19,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:49:19,723 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:49:19,723 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:49:19,728 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:49:19,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:19,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:49:18" (1/3) ... [2019-01-01 21:49:19,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a95b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:19, skipping insertion in model container [2019-01-01 21:49:19,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:19,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:19" (2/3) ... [2019-01-01 21:49:19,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61a95b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:19, skipping insertion in model container [2019-01-01 21:49:19,734 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:19,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:19" (3/3) ... [2019-01-01 21:49:19,737 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-termination.c.i [2019-01-01 21:49:19,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:49:19,803 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:49:19,803 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:49:19,803 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:49:19,803 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:49:19,803 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:49:19,803 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:49:19,803 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:49:19,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:49:19,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:19,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:19,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:19,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:19,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:19,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:19,851 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:49:19,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 21:49:19,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:19,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:19,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:19,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:19,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:49:19,865 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 3#L552-4true [2019-01-01 21:49:19,866 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 20#L552-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L552-4true [2019-01-01 21:49:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 21:49:19,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:19,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:19,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-01-01 21:49:20,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:20,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:20,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:49:20,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:49:20,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:49:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:49:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:49:20,112 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-01-01 21:49:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:49:20,120 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-01 21:49:20,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:49:20,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-01 21:49:20,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:20,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-01-01 21:49:20,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:49:20,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 21:49:20,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 21:49:20,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:20,131 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 21:49:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-01 21:49:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-01 21:49:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-01 21:49:20,155 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:20,155 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:49:20,155 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:20,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-01 21:49:20,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-01 21:49:20,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:20,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:20,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:20,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:20,158 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 44#L552-4 [2019-01-01 21:49:20,158 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 51#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 55#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 46#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 47#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 44#L552-4 [2019-01-01 21:49:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-01-01 21:49:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:20,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-01-01 21:49:20,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:20,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-01-01 21:49:20,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:20,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:21,063 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 21:49:21,985 WARN L181 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-01 21:49:22,350 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-01-01 21:49:22,505 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 21:49:22,523 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:22,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:22,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:22,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:22,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:22,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:22,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:22,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:22,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:49:22,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:22,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:22,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:22,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:22,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:22,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:22,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,005 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-01-01 21:49:23,347 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-01 21:49:23,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:24,345 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 21:49:24,472 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:49:24,868 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-01-01 21:49:25,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:25,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:25,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:25,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:25,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:25,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:25,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:25,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:25,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:25,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:25,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:25,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,050 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 21:49:25,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,069 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 21:49:25,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:25,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,186 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2019-01-01 21:49:25,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:49:25,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:25,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:25,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:25,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:25,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:25,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:25,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:25,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:25,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:25,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:25,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:25,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:25,285 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:25,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:25,318 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:49:25,321 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:25,322 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:25,323 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:25,323 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2019-01-01 21:49:25,411 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 21:49:25,422 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:25,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:25,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:25,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:49:25,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:49:25,676 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. [2019-01-01 21:49:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-01 21:49:25,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-01-01 21:49:25,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:25,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 21:49:25,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:25,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-01-01 21:49:25,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:25,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-01-01 21:49:25,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:25,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-01-01 21:49:25,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:49:25,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:49:25,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-01-01 21:49:25,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:25,687 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-01-01 21:49:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-01 21:49:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:49:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-01-01 21:49:25,691 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:25,691 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-01-01 21:49:25,691 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:49:25,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-01-01 21:49:25,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:25,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:25,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:25,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:25,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:25,693 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 178#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 193#L555-5 [2019-01-01 21:49:25,693 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 187#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 193#L555-5 [2019-01-01 21:49:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-01-01 21:49:25,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:25,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:25,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-01-01 21:49:25,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:25,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-01-01 21:49:25,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:25,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,108 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:49:26,294 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:49:26,688 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 100 [2019-01-01 21:49:26,909 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-01 21:49:26,914 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:26,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:26,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:26,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:26,915 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:26,915 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:26,915 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:26,915 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:26,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:49:26,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:26,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:26,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:26,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,441 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-01-01 21:49:27,627 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-01-01 21:49:27,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:27,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:28,357 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:49:29,005 WARN L181 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:49:29,049 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:29,049 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:29,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:29,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:29,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:29,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,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 [2019-01-01 21:49:29,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,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 [2019-01-01 21:49:29,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:49:29,111 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2019-01-01 21:49:29,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,136 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-01-01 21:49:29,136 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-01-01 21:49:29,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:29,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:29,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:29,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:29,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:29,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:29,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:29,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:29,307 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:29,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:49:29,337 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:49:29,337 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:29,339 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:29,341 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:29,341 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-01-01 21:49:29,504 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 21:49:29,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:29,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:29,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:29,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:49:29,671 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-01 21:49:29,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2019-01-01 21:49:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:49:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:49:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-01 21:49:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 21:49:29,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-01 21:49:29,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:29,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-01-01 21:49:29,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:29,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-01-01 21:49:29,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:49:29,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:49:29,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-01-01 21:49:29,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:49:29,955 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-01-01 21:49:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-01-01 21:49:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-01-01 21:49:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-01 21:49:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-01 21:49:29,958 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:49:29,958 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-01 21:49:29,958 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:49:29,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-01-01 21:49:29,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:29,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:29,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:29,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:29,960 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:29,960 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 358#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 359#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 375#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 380#L555-1 assume !cstrcspn_#t~short7; 379#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 378#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 363#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 364#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 360#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 362#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 374#L555-5 [2019-01-01 21:49:29,961 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 368#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 369#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 374#L555-5 [2019-01-01 21:49:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-01-01 21:49:29,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,983 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-01-01 21:49:29,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-01-01 21:49:29,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:29,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:49:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:49:30,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:49:30,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:49:30,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:30,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-01-01 21:49:30,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2019-01-01 21:49:30,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:30,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2019-01-01 21:49:30,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2019-01-01 21:49:30,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:30,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-01 21:49:30,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:30,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:30,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:30,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-01 21:49:30,708 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-01-01 21:50:08,646 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:50:33,835 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:50:49,398 WARN L181 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:50:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:49,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:50:49,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-01 21:50:49,759 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-01 21:50:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 21:50:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=116, Unknown=7, NotChecked=0, Total=156 [2019-01-01 21:50:49,761 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-01-01 21:50:53,560 WARN L181 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-01 21:50:56,756 WARN L181 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-01-01 21:50:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:56,910 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-01 21:50:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 21:50:56,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-01-01 21:50:56,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:56,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-01-01 21:50:56,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:50:56,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:50:56,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-01-01 21:50:56,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:50:56,918 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-01-01 21:50:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-01-01 21:50:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-01-01 21:50:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 21:50:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 21:50:56,924 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 21:50:56,924 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 21:50:56,924 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:50:56,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 21:50:56,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:56,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:56,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:56,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:50:56,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:56,929 INFO L794 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 533#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 527#L565 assume !(main_~length1~0 < 1); 528#L565-2 assume !(main_~length2~0 < 1); 526#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 519#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 520#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 538#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 531#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 532#L555-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 541#L555-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 524#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 525#L552-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 521#L552-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 523#L552-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 535#L555-5 [2019-01-01 21:50:56,929 INFO L796 eck$LassoCheckResult]: Loop: 535#L555-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 529#L555-1 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 530#L555-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 535#L555-5 [2019-01-01 21:50:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:56,929 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-01-01 21:50:56,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:56,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:56,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:56,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-01-01 21:50:56,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:56,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-01-01 21:50:56,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:56,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:56,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:57,768 WARN L181 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-01-01 21:50:58,595 WARN L181 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 137 [2019-01-01 21:50:59,638 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2019-01-01 21:50:59,641 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:50:59,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:50:59,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:50:59,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:50:59,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:50:59,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:59,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:50:59,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:50:59,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration5_Lasso [2019-01-01 21:50:59,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:50:59,643 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:50:59,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:59,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-01 21:51:00,964 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-01-01 21:51:01,140 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-01 21:51:01,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:51:01,564 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-01-01 21:51:02,283 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:51:03,009 WARN L181 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-01-01 21:51:03,206 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-01-01 21:51:03,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:51:03,242 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:51:03,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:03,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:03,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:03,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:03,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:51:03,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:51:03,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:51:03,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:51:03,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:51:03,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:51:03,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:51:03,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:51:03,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:51:03,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:51:03,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:51:03,317 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:51:03,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:51:03,329 INFO L444 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:51:03,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:51:03,330 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:51:03,331 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:51:03,332 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-01-01 21:51:03,659 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2019-01-01 21:51:03,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:51:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:03,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:03,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:03,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:51:03,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:51:03,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-01 21:51:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:51:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:51:03,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:51:03,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:03,819 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:51:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:03,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:03,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:03,894 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:51:03,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:51:03,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 6 states. [2019-01-01 21:51:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:51:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-01 21:51:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:51:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:03,967 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:51:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:51:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:04,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:51:04,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:51:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:51:04,048 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:51:04,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:51:04,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 45 states and 60 transitions. Complement of second has 5 states. [2019-01-01 21:51:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:51:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:51:04,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 21:51:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:51:04,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:04,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:51:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:04,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 21:51:04,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:51:04,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-01-01 21:51:04,105 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:51:04,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-01-01 21:51:04,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:51:04,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:51:04,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:51:04,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:51:04,105 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:04,105 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:04,106 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:51:04,106 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:51:04,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:51:04,106 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:51:04,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:51:04,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:51:04 BoogieIcfgContainer [2019-01-01 21:51:04,113 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:51:04,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:51:04,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:51:04,114 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:51:04,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:19" (3/4) ... [2019-01-01 21:51:04,118 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:51:04,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:51:04,119 INFO L168 Benchmark]: Toolchain (without parser) took 105843.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -50.8 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:04,120 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:04,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:04,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.73 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:04,122 INFO L168 Benchmark]: Boogie Preprocessor took 33.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:04,122 INFO L168 Benchmark]: RCFGBuilder took 589.74 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:04,123 INFO L168 Benchmark]: BuchiAutomizer took 104389.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 299.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:51:04,124 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:51:04,128 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.22 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 766.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.73 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.71 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 589.74 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 104389.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 299.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 104.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 95.8s. Construction of modules took 0.4s. Büchi inclusion checks took 7.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, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102 SDtfs, 151 SDslu, 110 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax105 hnf99 lsp87 ukn72 mio100 lsp30 div135 bol100 ite100 ukn100 eq159 hnf81 smp91 dnf1042 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 161ms 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...