./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/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 900f92af74c0348435977f69b7ec984c63076a1b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:21:28,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:21:28,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:21:28,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:21:28,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:21:28,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:21:28,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:21:28,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:21:28,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:21:28,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:21:28,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:21:28,534 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:21:28,535 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:21:28,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:21:28,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:21:28,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:21:28,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:21:28,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:21:28,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:21:28,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:21:28,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:21:28,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:21:28,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:21:28,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:21:28,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:21:28,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:21:28,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:21:28,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:21:28,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:21:28,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:21:28,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:21:28,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:21:28,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:21:28,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:21:28,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:21:28,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:21:28,550 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 05:21:28,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:21:28,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:21:28,562 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:21:28,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:21:28,562 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:21:28,562 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:21:28,562 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:21:28,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:21:28,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:21:28,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:21:28,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:21:28,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:21:28,565 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:21:28,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:21:28,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:21:28,565 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:21:28,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:21:28,566 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_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/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 -> 900f92af74c0348435977f69b7ec984c63076a1b [2018-11-10 05:21:28,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:21:28,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:21:28,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:21:28,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:21:28,601 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:21:28,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-10 05:21:28,635 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/data/b35075e5c/d59e49f046dc4567b39e7ece5f7d3324/FLAG99cf08d17 [2018-11-10 05:21:29,051 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:21:29,051 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-10 05:21:29,057 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/data/b35075e5c/d59e49f046dc4567b39e7ece5f7d3324/FLAG99cf08d17 [2018-11-10 05:21:29,065 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/bin-2019/uautomizer/data/b35075e5c/d59e49f046dc4567b39e7ece5f7d3324 [2018-11-10 05:21:29,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:21:29,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:21:29,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:21:29,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:21:29,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:21:29,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2526df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29, skipping insertion in model container [2018-11-10 05:21:29,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:21:29,103 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:21:29,276 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:21:29,282 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:21:29,311 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:21:29,334 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:21:29,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29 WrapperNode [2018-11-10 05:21:29,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:21:29,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:21:29,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:21:29,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:21:29,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:21:29,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:21:29,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:21:29,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:21:29,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... [2018-11-10 05:21:29,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:21:29,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:21:29,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:21:29,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:21:29,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0bd6b552-8aa8-4120-af6d-8ebc30a8f292/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-10 05:21:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 05:21:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 05:21:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:21:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:21:29,634 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:21:29,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:21:29 BoogieIcfgContainer [2018-11-10 05:21:29,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:21:29,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:21:29,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:21:29,638 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:21:29,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:21:29,638 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:21:29" (1/3) ... [2018-11-10 05:21:29,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b19a437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:21:29, skipping insertion in model container [2018-11-10 05:21:29,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:21:29,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:21:29" (2/3) ... [2018-11-10 05:21:29,640 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b19a437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:21:29, skipping insertion in model container [2018-11-10 05:21:29,640 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:21:29,640 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:21:29" (3/3) ... [2018-11-10 05:21:29,641 INFO L375 chiAutomizerObserver]: Analyzing ICFG strrchr_true-termination.c.i [2018-11-10 05:21:29,679 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:21:29,679 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:21:29,680 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:21:29,680 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:21:29,680 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:21:29,680 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:21:29,680 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:21:29,680 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:21:29,680 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:21:29,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 05:21:29,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 05:21:29,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:21:29,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:21:29,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:21:29,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:21:29,705 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:21:29,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 05:21:29,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 05:21:29,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:21:29,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:21:29,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 05:21:29,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:21:29,714 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~ret17.base, main_#t~ret17.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~the_int~0;main_~in_len~0 := main_#t~nondet14;havoc main_#t~nondet14; 27#L520true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; 6#L522true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L522 23#L522-1true main_~the_int~0 := main_#t~nondet16;havoc main_#t~nondet16;assume { :begin_inline_strrchr } true;strrchr_#in~t.base, strrchr_#in~t.offset, strrchr_#in~c := main_~in~0.base, main_~in~0.offset, main_~the_int~0;havoc strrchr_#res.base, strrchr_#res.offset;havoc strrchr_#t~mem2, strrchr_#t~mem3, strrchr_#t~pre4.base, strrchr_#t~pre4.offset, strrchr_#t~mem5, strrchr_#t~mem6, strrchr_#t~pre7.base, strrchr_#t~pre7.offset, strrchr_#t~mem8, strrchr_#t~mem9, strrchr_#t~pre10.base, strrchr_#t~pre10.offset, strrchr_#t~mem11, strrchr_#t~mem12, strrchr_#t~pre13.base, strrchr_#t~pre13.offset, strrchr_~t.base, strrchr_~t.offset, strrchr_~c, strrchr_~ch~0, strrchr_~l~0.base, strrchr_~l~0.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_#in~t.base, strrchr_#in~t.offset;strrchr_~c := strrchr_#in~c;havoc strrchr_~ch~0;strrchr_~l~0.base, strrchr_~l~0.offset := 0, 0;strrchr_~ch~0 := (if strrchr_~c % 256 <= 127 then strrchr_~c % 256 else strrchr_~c % 256 - 256); 14#L510-3true [2018-11-10 05:21:29,715 INFO L795 eck$LassoCheckResult]: Loop: 14#L510-3true assume true; 10#L510-1true assume !false; 7#L511true SUMMARY for call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L511 24#L511-1true assume strrchr_#t~mem2 == strrchr_~ch~0;havoc strrchr_#t~mem2;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 29#L511-3true SUMMARY for call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L511-3 30#L511-4true assume !(strrchr_#t~mem3 == 0);havoc strrchr_#t~mem3;strrchr_#t~pre4.base, strrchr_#t~pre4.offset := strrchr_~t.base, strrchr_~t.offset + 1;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, strrchr_~t.offset + 1;havoc strrchr_#t~pre4.base, strrchr_#t~pre4.offset; 20#L512true SUMMARY for call strrchr_#t~mem5 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L512 21#L512-1true assume strrchr_#t~mem5 == strrchr_~ch~0;havoc strrchr_#t~mem5;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 11#L512-3true SUMMARY for call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L512-3 13#L512-4true assume !(strrchr_#t~mem6 == 0);havoc strrchr_#t~mem6;strrchr_#t~pre7.base, strrchr_#t~pre7.offset := strrchr_~t.base, strrchr_~t.offset + 1;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, strrchr_~t.offset + 1;havoc strrchr_#t~pre7.base, strrchr_#t~pre7.offset; 4#L513true SUMMARY for call strrchr_#t~mem8 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L513 5#L513-1true assume strrchr_#t~mem8 == strrchr_~ch~0;havoc strrchr_#t~mem8;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 25#L513-3true SUMMARY for call strrchr_#t~mem9 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L513-3 28#L513-4true assume !(strrchr_#t~mem9 == 0);havoc strrchr_#t~mem9;strrchr_#t~pre10.base, strrchr_#t~pre10.offset := strrchr_~t.base, strrchr_~t.offset + 1;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, strrchr_~t.offset + 1;havoc strrchr_#t~pre10.base, strrchr_#t~pre10.offset; 18#L514true SUMMARY for call strrchr_#t~mem11 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L514 19#L514-1true assume strrchr_#t~mem11 == strrchr_~ch~0;havoc strrchr_#t~mem11;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 22#L514-3true SUMMARY for call strrchr_#t~mem12 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); srcloc: L514-3 9#L514-4true assume !(strrchr_#t~mem12 == 0);havoc strrchr_#t~mem12;strrchr_#t~pre13.base, strrchr_#t~pre13.offset := strrchr_~t.base, strrchr_~t.offset + 1;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, strrchr_~t.offset + 1;havoc strrchr_#t~pre13.base, strrchr_#t~pre13.offset; 14#L510-3true [2018-11-10 05:21:29,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:21:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 28695717, now seen corresponding path program 1 times [2018-11-10 05:21:29,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:21:29,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:21:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:21:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:29,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:21:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1279150214, now seen corresponding path program 1 times [2018-11-10 05:21:29,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:21:29,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:21:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:21:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:29,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:21:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1474020394, now seen corresponding path program 1 times [2018-11-10 05:21:29,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:21:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:21:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:21:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:21:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:21:30,162 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-11-10 05:21:30,321 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-10 05:21:30,470 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 05:21:30,478 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:21:30,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:21:30,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:21:30,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:21:30,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:21:30,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:21:30,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:21:30,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:21:30,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration1_Lasso [2018-11-10 05:21:30,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:21:30,480 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:21:30,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-10 05:21:30,506 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-10 05:21:30,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-10 05:21:30,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-10 05:21:30,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-10 05:21:30,511 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-10 05:21:30,513 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-10 05:21:30,515 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-10 05:21:30,516 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-10 05:21:30,518 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-10 05:21:30,519 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-10 05:21:30,520 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-10 05:21:30,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-10 05:21:30,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-10 05:21:30,525 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-10 05:21:30,526 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-10 05:21:30,528 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-10 05:21:30,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-10 05:21:30,530 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-10 05:21:30,840 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-11-10 05:21:30,911 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-10 05:21:30,913 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-10 05:21:30,914 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-10 05:21:30,915 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-10 05:21:30,917 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-10 05:21:30,918 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-10 05:21:30,919 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-10 05:21:31,316 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:21:31,321 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:21:31,322 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-10 05:21:31,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:21:31,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:21:31,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:21:31,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,336 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-10 05:21:31,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,341 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-10 05:21:31,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,346 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-10 05:21:31,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:21:31,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,353 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-10 05:21:31,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,356 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-10 05:21:31,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,358 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-10 05:21:31,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:21:31,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,366 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-10 05:21:31,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,368 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-10 05:21:31,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:21:31,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:21:31,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:21:31,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,376 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-10 05:21:31,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,379 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-10 05:21:31,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,381 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-10 05:21:31,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,383 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-10 05:21:31,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,385 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-10 05:21:31,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:21:31,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:21:31,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:21:31,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,393 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-10 05:21:31,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:21:31,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:21:31,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:21:31,403 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-10 05:21:31,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:21:31,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:21:31,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:21:31,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:21:31,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:21:31,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 05:21:31,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:21:31,470 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 05:21:31,471 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 05:21:31,472 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:21:31,474 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 05:21:31,474 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:21:31,475 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1, ULTIMATE.start_strrchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 - 1*ULTIMATE.start_strrchr_~t.offset Supporting invariants [] [2018-11-10 05:21:31,505 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-10 05:21:31,509 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:21:31,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 05:21:31,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 05:21:31,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:21:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:21:31,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:21:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:21:31,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:21:31,654 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-10 05:21:31,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-10 05:21:31,664 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 8 states. [2018-11-10 05:21:31,747 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 8 states. Result 61 states and 81 transitions. Complement of second has 8 states. [2018-11-10 05:21:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 05:21:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 05:21:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-10 05:21:31,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-10 05:21:31,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:21:31,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-10 05:21:31,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:21:31,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-10 05:21:31,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:21:31,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 81 transitions. [2018-11-10 05:21:31,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:21:31,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2018-11-10 05:21:31,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 05:21:31,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 05:21:31,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 05:21:31,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:21:31,758 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:21:31,758 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:21:31,758 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:21:31,758 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:21:31,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:21:31,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 05:21:31,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 05:21:31,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:21:31 BoogieIcfgContainer [2018-11-10 05:21:31,762 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:21:31,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:21:31,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:21:31,763 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:21:31,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:21:29" (3/4) ... [2018-11-10 05:21:31,765 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:21:31,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:21:31,765 INFO L168 Benchmark]: Toolchain (without parser) took 2698.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 958.5 MB in the beginning and 1.0 GB in the end (delta: -70.2 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:21:31,766 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:21:31,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.93 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 935.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:21:31,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 935.7 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:21:31,767 INFO L168 Benchmark]: Boogie Preprocessor took 20.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:21:31,767 INFO L168 Benchmark]: RCFGBuilder took 208.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:21:31,767 INFO L168 Benchmark]: BuchiAutomizer took 2127.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:21:31,768 INFO L168 Benchmark]: Witness Printer took 2.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:21:31,770 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.93 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 935.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 935.7 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2127.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 57.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 167.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * t and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 33 SDslu, 62 SDs, 0 SdLazy, 68 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital296 mio100 ax100 hnf99 lsp73 ukn120 mio100 lsp27 div134 bol100 ite100 ukn100 eq165 hnf73 smp85 dnf233 smp60 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...