./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer --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.23-0cd3be1 [2018-11-28 12:39:59,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:39:59,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:39:59,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:39:59,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:39:59,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:39:59,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:39:59,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:39:59,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:39:59,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:39:59,377 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:39:59,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:39:59,378 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:39:59,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:39:59,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:39:59,380 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:39:59,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:39:59,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:39:59,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:39:59,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:39:59,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:39:59,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:39:59,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:39:59,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:39:59,388 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:39:59,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:39:59,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:39:59,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:39:59,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:39:59,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:39:59,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:39:59,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:39:59,392 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:39:59,392 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:39:59,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:39:59,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:39:59,393 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:39:59,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:39:59,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:39:59,405 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:39:59,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:39:59,406 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:39:59,406 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:39:59,406 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:39:59,406 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:39:59,406 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:39:59,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:39:59,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:39:59,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:39:59,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:39:59,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:39:59,409 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:39:59,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:39:59,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:39:59,409 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:39:59,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:39:59,410 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer 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 12:39:59,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:39:59,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:39:59,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:39:59,445 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:39:59,445 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:39:59,446 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-28 12:39:59,484 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/data/d08c43e24/08aa74775f074652acac2c78f309f3cf/FLAG30970f6d6 [2018-11-28 12:39:59,918 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:39:59,918 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-28 12:39:59,926 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/data/d08c43e24/08aa74775f074652acac2c78f309f3cf/FLAG30970f6d6 [2018-11-28 12:39:59,937 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/data/d08c43e24/08aa74775f074652acac2c78f309f3cf [2018-11-28 12:39:59,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:39:59,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:39:59,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:39:59,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:39:59,942 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:39:59,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:39:59" (1/1) ... [2018-11-28 12:39:59,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5717fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:39:59, skipping insertion in model container [2018-11-28 12:39:59,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:39:59" (1/1) ... [2018-11-28 12:39:59,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:39:59,972 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:40:00,167 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:40:00,224 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:40:00,261 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:40:00,292 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:40:00,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00 WrapperNode [2018-11-28 12:40:00,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:40:00,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:40:00,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:40:00,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:40:00,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:40:00,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:40:00,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:40:00,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:40:00,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... [2018-11-28 12:40:00,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:40:00,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:40:00,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:40:00,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:40:00,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9478e3a-38b3-499a-a6bb-3698ccd842db/bin-2019/uautomizer/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 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 12:40:00,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:40:00,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:40:00,701 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:40:00,701 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 12:40:00,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:40:00 BoogieIcfgContainer [2018-11-28 12:40:00,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:40:00,702 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:40:00,702 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:40:00,705 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:40:00,706 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:40:00,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:39:59" (1/3) ... [2018-11-28 12:40:00,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63964d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:40:00, skipping insertion in model container [2018-11-28 12:40:00,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:40:00,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:40:00" (2/3) ... [2018-11-28 12:40:00,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63964d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:40:00, skipping insertion in model container [2018-11-28 12:40:00,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:40:00,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:40:00" (3/3) ... [2018-11-28 12:40:00,708 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-11-28 12:40:00,746 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:40:00,747 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:40:00,747 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:40:00,747 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:40:00,747 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:40:00,747 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:40:00,747 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:40:00,747 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:40:00,747 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:40:00,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-28 12:40:00,774 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 12:40:00,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:40:00,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:40:00,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:40:00,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:40:00,780 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:40:00,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-11-28 12:40:00,782 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 12:40:00,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:40:00,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:40:00,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:40:00,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:40:00,788 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 12:40:00,789 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 12:40:00,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 12:40:00,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:00,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:00,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:00,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2018-11-28 12:40:00,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:00,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:00,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:00,889 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 12:40:00,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:00,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:01,189 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2018-11-28 12:40:01,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:40:01,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:40:01,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:40:01,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:40:01,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:40:01,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:40:01,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:40:01,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:40:01,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-11-28 12:40:01,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:40:01,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:40:01,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:01,314 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 12:40:01,497 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 12:40:01,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:01,499 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 12:40:01,500 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 12:40:01,502 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 12:40:01,503 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 12:40:01,504 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 12:40:01,505 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 12:40:01,507 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 12:40:01,509 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 12:40:01,510 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 12:40:01,522 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 12:40:01,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:01,529 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 12:40:01,531 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 12:40:01,533 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 12:40:01,534 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 12:40:01,535 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 12:40:01,536 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 12:40:01,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:01,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:40:01,771 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:40:01,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:40:01,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:01,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:01,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:01,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,778 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 12:40:01,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:40:01,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:01,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:01,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:01,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:40:01,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,800 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 12:40:01,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,806 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 12:40:01,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,807 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:40:01,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:40:01,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:40:01,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,823 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 12:40:01,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:01,827 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 12:40:01,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:01,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:01,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:01,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:01,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:01,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:01,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:40:01,903 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-28 12:40:01,903 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:40:01,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:40:01,907 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:40:01,907 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:40:01,908 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 12:40:01,943 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 12:40:01,949 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:40:01,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:40:01,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:40:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:40:02,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:40:02,017 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 12:40:02,027 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 12:40:02,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2018-11-28 12:40:02,168 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 12:40:02,169 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 12:40:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:40:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2018-11-28 12:40:02,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 12:40:02,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:02,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 12:40:02,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:02,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 12:40:02,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:02,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2018-11-28 12:40:02,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-11-28 12:40:02,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2018-11-28 12:40:02,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-28 12:40:02,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-28 12:40:02,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2018-11-28 12:40:02,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:40:02,186 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-11-28 12:40:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2018-11-28 12:40:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-11-28 12:40:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 12:40:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-11-28 12:40:02,204 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 12:40:02,204 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-11-28 12:40:02,204 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:40:02,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-11-28 12:40:02,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 12:40:02,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:40:02,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:40:02,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:40:02,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:40:02,206 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 12:40:02,206 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 12:40:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2018-11-28 12:40:02,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:02,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-11-28 12:40:02,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:02,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2018-11-28 12:40:02,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:02,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:40:02,309 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 12:40:02,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:40:02,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:40:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 12:40:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 12:40:02,337 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-28 12:40:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:40:02,470 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2018-11-28 12:40:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 12:40:02,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2018-11-28 12:40:02,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-11-28 12:40:02,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2018-11-28 12:40:02,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-11-28 12:40:02,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-28 12:40:02,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2018-11-28 12:40:02,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:40:02,475 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2018-11-28 12:40:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2018-11-28 12:40:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2018-11-28 12:40:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:40:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-11-28 12:40:02,479 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-28 12:40:02,479 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-11-28 12:40:02,479 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:40:02,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2018-11-28 12:40:02,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-28 12:40:02,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:40:02,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:40:02,480 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:40:02,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 12:40:02,481 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 12:40:02,481 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 12:40:02,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,481 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2018-11-28 12:40:02,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:02,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-11-28 12:40:02,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:40:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:02,507 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2018-11-28 12:40:02,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:40:02,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:40:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:40:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:40:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:40:02,882 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 149 [2018-11-28 12:40:02,998 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 12:40:02,999 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:40:02,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:40:02,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:40:02,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:40:02,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:40:03,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:40:03,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:40:03,000 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:40:03,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-11-28 12:40:03,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:40:03,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:40:03,004 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 12:40:03,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 12:40:03,008 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 12:40:03,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 12:40:03,014 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 12:40:03,016 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 12:40:03,017 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 12:40:03,018 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 12:40:03,019 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 12:40:03,020 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 12:40:03,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,203 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-11-28 12:40:03,246 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 12:40:03,247 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 12:40:03,249 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 12:40:03,252 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 12:40:03,253 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 12:40:03,254 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 12:40:03,255 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 12:40:03,256 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 12:40:03,257 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 12:40:03,258 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 12:40:03,259 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 12:40:03,261 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 12:40:03,262 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 12:40:03,263 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 12:40:03,264 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 12:40:03,266 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 12:40:03,267 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 12:40:03,268 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 12:40:03,270 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 12:40:03,271 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 12:40:03,272 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 12:40:03,273 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 12:40:03,274 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 12:40:03,275 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 12:40:03,276 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 12:40:03,277 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 12:40:03,278 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 12:40:03,279 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 12:40:03,280 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 12:40:03,281 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 12:40:03,282 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 12:40:03,283 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 12:40:03,285 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 12:40:03,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,287 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 12:40:03,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,289 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 12:40:03,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,293 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 12:40:03,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:40:03,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 12:40:03,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:40:03,672 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:40:03,673 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 12:40:03,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,675 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 12:40:03,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,677 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 12:40:03,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,679 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 12:40:03,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,686 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 12:40:03,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,688 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 12:40:03,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,690 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 12:40:03,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:40:03,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,695 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 12:40:03,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,696 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 12:40:03,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,699 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 12:40:03,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,702 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 12:40:03,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,706 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 12:40:03,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:40:03,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:40:03,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:40:03,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,708 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 12:40:03,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,709 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,709 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,716 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 12:40:03,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,719 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 12:40:03,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,725 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 12:40:03,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,728 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 12:40:03,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,728 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:40:03,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:40:03,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:40:03,746 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 12:40:03,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:40:03,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:40:03,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:40:03,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:40:03,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:40:03,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:40:03,764 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:40:03,778 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:40:03,778 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 12:40:03,779 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:40:03,779 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:40:03,780 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:40:03,780 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 12:40:03,835 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 12:40:03,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:40:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:40:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:40:03,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:40:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:40:03,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:40:03,891 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 12:40:03,892 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 12:40:03,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-11-28 12:40:03,966 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 12:40:03,966 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 12:40:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:40:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-28 12:40:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 12:40:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 12:40:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:03,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 12:40:03,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:40:03,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2018-11-28 12:40:03,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:40:03,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-28 12:40:03,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:40:03,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:40:03,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:40:03,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:40:03,969 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:40:03,969 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:40:03,969 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:40:03,969 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:40:03,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:40:03,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:40:03,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:40:03,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:40:03 BoogieIcfgContainer [2018-11-28 12:40:03,974 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:40:03,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:40:03,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:40:03,975 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:40:03,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:40:00" (3/4) ... [2018-11-28 12:40:03,977 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:40:03,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:40:03,978 INFO L168 Benchmark]: Toolchain (without parser) took 4039.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -285.8 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:40:03,979 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:40:03,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:40:03,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.30 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 12:40:03,980 INFO L168 Benchmark]: Boogie Preprocessor took 21.82 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:40:03,980 INFO L168 Benchmark]: RCFGBuilder took 355.87 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:40:03,980 INFO L168 Benchmark]: BuchiAutomizer took 3272.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:40:03,981 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:40:03,984 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 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.30 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 21.82 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 355.87 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: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3272.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -155.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.99 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. 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.1s 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: 11ms 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...