./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strtol_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 7d3a15f933181b44751784c7ab9846d6b1216531 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:18:19,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:19,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:19,315 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:19,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:19,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:19,318 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:19,320 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:19,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:19,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:19,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:19,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:19,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:19,327 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:19,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:19,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:19,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:19,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:19,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:19,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:19,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:19,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:19,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:19,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:19,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:19,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:19,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:19,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:19,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:19,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:19,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:19,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:19,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:19,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:19,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:19,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:19,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:19,371 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:19,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:19,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:19,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:19,374 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:19,374 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:19,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:19,374 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:19,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:19,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:19,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:19,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:19,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:19,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:19,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:19,377 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:19,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:19,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:19,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:19,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:19,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:19,380 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:19,380 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:19,381 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:19,381 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 -> 7d3a15f933181b44751784c7ab9846d6b1216531 [2018-11-28 23:18:19,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:19,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:19,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:19,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:19,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:19,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2018-11-28 23:18:19,504 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6149bfb53/4178730ebef144b48eb13ced160eb4f5/FLAG15f1eed4a [2018-11-28 23:18:20,029 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:20,032 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2018-11-28 23:18:20,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6149bfb53/4178730ebef144b48eb13ced160eb4f5/FLAG15f1eed4a [2018-11-28 23:18:20,300 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6149bfb53/4178730ebef144b48eb13ced160eb4f5 [2018-11-28 23:18:20,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:20,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:20,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:20,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:20,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:20,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:20" (1/1) ... [2018-11-28 23:18:20,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0c55c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:20, skipping insertion in model container [2018-11-28 23:18:20,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:20" (1/1) ... [2018-11-28 23:18:20,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:20,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:20,874 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:20,889 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:20,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:21,193 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:21,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21 WrapperNode [2018-11-28 23:18:21,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:21,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:21,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:21,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:21,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:21,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:21,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:21,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:21,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... [2018-11-28 23:18:21,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:21,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:21,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:21,384 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:21,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:21,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 23:18:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 23:18:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 23:18:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:22,301 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:22,301 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 23:18:22,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:22 BoogieIcfgContainer [2018-11-28 23:18:22,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:22,303 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:22,303 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:22,307 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:22,308 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:22,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:20" (1/3) ... [2018-11-28 23:18:22,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e4e0211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:22, skipping insertion in model container [2018-11-28 23:18:22,310 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:22,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:21" (2/3) ... [2018-11-28 23:18:22,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e4e0211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:22, skipping insertion in model container [2018-11-28 23:18:22,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:22,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:22" (3/3) ... [2018-11-28 23:18:22,313 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-11-28 23:18:22,378 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:22,378 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:22,379 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:22,379 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:22,379 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:22,379 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:22,379 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:22,379 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:22,379 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:22,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-28 23:18:22,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:18:22,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:22,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:22,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:22,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:22,433 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:22,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-28 23:18:22,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:18:22,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:22,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:22,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:22,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:22,447 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 42#L562true assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 15#L554-3true [2018-11-28 23:18:22,447 INFO L796 eck$LassoCheckResult]: Loop: 15#L554-3true call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 12#L554-1true assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 15#L554-3true [2018-11-28 23:18:22,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:18:22,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:22,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:22,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2018-11-28 23:18:22,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:22,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:22,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 23:18:22,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:22,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:22,937 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:18:24,058 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2018-11-28 23:18:24,215 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-28 23:18:24,231 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:24,233 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:24,233 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:24,233 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:24,233 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:24,233 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:24,234 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:24,234 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:24,234 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:24,234 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:24,235 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:24,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,670 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-11-28 23:18:24,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:24,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:25,515 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:25,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:25,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:25,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:25,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:25,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:25,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:25,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:25,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,572 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,581 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:25,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,585 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:25,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:25,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:25,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:25,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:25,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:25,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:25,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:25,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:25,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:25,794 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 23:18:25,794 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:18:25,799 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:25,807 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:25,808 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:25,809 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtol_~nptr.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1) = -1*ULTIMATE.start_strtol_~nptr.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 Supporting invariants [] [2018-11-28 23:18:25,896 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 23:18:25,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:25,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:26,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:26,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:26,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:18:26,066 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2018-11-28 23:18:26,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 3 states. Result 192 states and 307 transitions. Complement of second has 8 states. [2018-11-28 23:18:26,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:18:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2018-11-28 23:18:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:18:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:18:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:18:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:26,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2018-11-28 23:18:26,645 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-11-28 23:18:26,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2018-11-28 23:18:26,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-28 23:18:26,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-28 23:18:26,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2018-11-28 23:18:26,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:26,655 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-11-28 23:18:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2018-11-28 23:18:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-11-28 23:18:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:18:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-28 23:18:26,686 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 23:18:26,686 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 23:18:26,686 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:26,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-28 23:18:26,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:18:26,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:26,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:26,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:26,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:26,689 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 328#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 338#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 329#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 330#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 321#L555 assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; 322#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 336#L512-3 [2018-11-28 23:18:26,689 INFO L796 eck$LassoCheckResult]: Loop: 336#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 337#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 336#L512-3 [2018-11-28 23:18:26,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2018-11-28 23:18:26,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:26,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:26,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:26,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:26,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-28 23:18:26,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:26,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2018-11-28 23:18:26,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:26,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:26,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:26,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:18:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:18:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:18:27,031 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-28 23:18:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:27,554 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2018-11-28 23:18:27,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:18:27,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2018-11-28 23:18:27,559 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-28 23:18:27,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2018-11-28 23:18:27,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-28 23:18:27,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-28 23:18:27,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2018-11-28 23:18:27,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:27,563 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2018-11-28 23:18:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2018-11-28 23:18:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2018-11-28 23:18:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:18:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-11-28 23:18:27,567 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-28 23:18:27,567 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-28 23:18:27,567 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:27,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2018-11-28 23:18:27,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 23:18:27,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:27,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:27,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:27,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:27,570 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 454#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 455#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 466#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 460#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 462#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 479#L555 assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 480#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 463#L512-3 [2018-11-28 23:18:27,570 INFO L796 eck$LassoCheckResult]: Loop: 463#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 464#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 463#L512-3 [2018-11-28 23:18:27,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2018-11-28 23:18:27,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:27,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-28 23:18:27,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:27,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:27,609 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2018-11-28 23:18:27,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:27,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:27,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:28,730 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 160 DAG size of output: 149 [2018-11-28 23:18:28,972 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 23:18:28,974 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:28,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:28,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:28,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:28,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:28,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:28,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:28,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:28,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:28,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:28,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:28,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:28,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:28,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:28,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,491 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-11-28 23:18:29,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:29,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:30,156 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-28 23:18:30,563 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-28 23:18:30,719 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 23:18:30,994 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:30,994 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:30,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:30,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:30,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:30,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:30,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:30,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,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 [2018-11-28 23:18:31,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,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 [2018-11-28 23:18:31,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:31,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:31,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:31,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,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 [2018-11-28 23:18:31,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,163 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:31,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:31,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:31,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:31,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:31,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:31,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:31,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:31,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:31,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:31,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:31,271 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:18:31,272 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:18:31,272 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:31,275 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:31,276 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:31,276 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_main_~in~0.base)_1) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~in~0.base)_1 Supporting invariants [] [2018-11-28 23:18:31,401 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 23:18:31,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:31,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:31,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:31,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:31,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-28 23:18:31,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-28 23:18:31,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 77 states and 110 transitions. Complement of second has 7 states. [2018-11-28 23:18:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-28 23:18:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:18:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:18:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:31,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:18:31,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:31,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2018-11-28 23:18:31,878 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:31,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-28 23:18:31,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:31,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:31,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:31,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:31,881 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:31,881 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:31,881 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:31,881 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:31,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:31,882 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:31,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:31,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:31 BoogieIcfgContainer [2018-11-28 23:18:31,889 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:31,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:31,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:31,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:31,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:22" (3/4) ... [2018-11-28 23:18:31,895 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:31,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:31,896 INFO L168 Benchmark]: Toolchain (without parser) took 11589.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -303.9 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:31,897 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:31,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:31,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:31,900 INFO L168 Benchmark]: Boogie Preprocessor took 81.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:31,900 INFO L168 Benchmark]: RCFGBuilder took 918.62 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:31,901 INFO L168 Benchmark]: BuchiAutomizer took 9586.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -155.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:31,902 INFO L168 Benchmark]: Witness Printer took 5.37 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:31,907 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.16 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 885.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.82 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 918.62 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9586.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -155.6 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.37 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[in] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.7s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 162 SDtfs, 217 SDslu, 292 SDs, 0 SdLazy, 233 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf100 lsp91 ukn67 mio100 lsp37 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf107 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...