./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_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_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/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 886a4a8709e4979ee81c36ac10a56c06722d29ce ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:09:20,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:20,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:20,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:20,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:20,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:20,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:20,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:20,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:20,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:20,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:20,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:20,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:20,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:20,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:20,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:20,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:20,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:20,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:20,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:20,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:20,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:20,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:20,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:20,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:20,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:20,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:20,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:20,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:20,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:20,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:20,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:20,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:20,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:20,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:20,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:20,540 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:20,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:20,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:20,553 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:20,553 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:20,553 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:20,553 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:20,553 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:20,553 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:20,553 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:20,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:20,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:20,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:20,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:20,555 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:20,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:20,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:20,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:20,557 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:20,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:20,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:20,558 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:20,558 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:20,559 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_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/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 -> 886a4a8709e4979ee81c36ac10a56c06722d29ce [2018-10-27 06:09:20,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:20,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:20,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:20,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:20,604 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:20,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i [2018-10-27 06:09:20,646 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/data/44ade2ea7/eb13f3fedcab41c5ad34786535faa55d/FLAG7750e8893 [2018-10-27 06:09:21,073 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:21,074 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i [2018-10-27 06:09:21,083 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/data/44ade2ea7/eb13f3fedcab41c5ad34786535faa55d/FLAG7750e8893 [2018-10-27 06:09:21,099 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/bin-2019/uautomizer/data/44ade2ea7/eb13f3fedcab41c5ad34786535faa55d [2018-10-27 06:09:21,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:21,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:21,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:21,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:21,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:21,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7d7c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21, skipping insertion in model container [2018-10-27 06:09:21,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:21,154 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:21,384 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:21,391 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:21,431 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:21,481 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:21,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21 WrapperNode [2018-10-27 06:09:21,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:21,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:21,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:21,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:21,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:21,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:21,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:21,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:21,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... [2018-10-27 06:09:21,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:21,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:21,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:21,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:21,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9ef5c1b-2f61-4cc7-8af9-aabba2608302/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-10-27 06:09:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:21,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:22,137 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:22,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:22 BoogieIcfgContainer [2018-10-27 06:09:22,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:22,138 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:22,138 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:22,142 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:22,143 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:22,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:21" (1/3) ... [2018-10-27 06:09:22,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45a43b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:22, skipping insertion in model container [2018-10-27 06:09:22,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:22,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:21" (2/3) ... [2018-10-27 06:09:22,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45a43b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:22, skipping insertion in model container [2018-10-27 06:09:22,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:22,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:22" (3/3) ... [2018-10-27 06:09:22,146 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrchr_diffterm_alloca_true-termination.c.i [2018-10-27 06:09:22,199 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:22,200 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:22,200 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:22,200 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:22,200 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:22,200 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:22,200 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:22,201 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:22,201 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:22,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-10-27 06:09:22,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:22,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:22,239 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:22,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-10-27 06:09:22,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:22,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,241 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,241 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:22,248 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~malloc212.base, main_#t~malloc212.offset, main_#t~nondet213, main_#t~ret214.base, main_#t~ret214.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211; 13#L372true assume !(main_~length~0 < 1); 16#L372-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;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~malloc212.base, main_#t~malloc212.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc212.base, main_#t~malloc212.offset; 5#L376true SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L376 8#L376-1true assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet213;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset, cstrchr_#t~mem205, cstrchr_#t~mem206, cstrchr_#t~short207, cstrchr_#t~mem209, cstrchr_#t~ite210.base, cstrchr_#t~ite210.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 21#L366-9true [2018-10-27 06:09:22,248 INFO L795 eck$LassoCheckResult]: Loop: 21#L366-9true assume true; 6#L366-1true SUMMARY for call cstrchr_#t~mem205 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-1 9#L366-2true cstrchr_#t~short207 := cstrchr_#t~mem205 != 49; 10#L366-3true assume !cstrchr_#t~short207; 17#L366-7true assume !!cstrchr_#t~short207;havoc cstrchr_#t~mem206;havoc cstrchr_#t~mem205;havoc cstrchr_#t~short207;cstrchr_#t~post208.base, cstrchr_#t~post208.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post208.base, cstrchr_#t~post208.offset + 1;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset; 21#L366-9true [2018-10-27 06:09:22,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 1 times [2018-10-27 06:09:22,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash 43006517, now seen corresponding path program 1 times [2018-10-27 06:09:22,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:22,410 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:22,423 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-27 06:09:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:22,532 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-27 06:09:22,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:22,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-10-27 06:09:22,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:22,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 14 transitions. [2018-10-27 06:09:22,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-10-27 06:09:22,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-10-27 06:09:22,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-10-27 06:09:22,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:22,541 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-10-27 06:09:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-10-27 06:09:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-27 06:09:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-27 06:09:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-10-27 06:09:22,568 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-10-27 06:09:22,568 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-10-27 06:09:22,568 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:22,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-10-27 06:09:22,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:09:22,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:22,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:22,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:22,571 INFO L793 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~malloc212.base, main_#t~malloc212.offset, main_#t~nondet213, main_#t~ret214.base, main_#t~ret214.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211; 59#L372 assume !(main_~length~0 < 1); 60#L372-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;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~malloc212.base, main_#t~malloc212.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc212.base, main_#t~malloc212.offset; 50#L376 SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L376 51#L376-1 assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet213;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset, cstrchr_#t~mem205, cstrchr_#t~mem206, cstrchr_#t~short207, cstrchr_#t~mem209, cstrchr_#t~ite210.base, cstrchr_#t~ite210.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 54#L366-9 [2018-10-27 06:09:22,571 INFO L795 eck$LassoCheckResult]: Loop: 54#L366-9 assume true; 52#L366-1 SUMMARY for call cstrchr_#t~mem205 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-1 53#L366-2 cstrchr_#t~short207 := cstrchr_#t~mem205 != 49; 55#L366-3 assume cstrchr_#t~short207; 56#L366-4 SUMMARY for call cstrchr_#t~mem206 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-4 57#L366-5 cstrchr_#t~short207 := cstrchr_#t~mem206 != (if cstrchr_~c % 256 <= 127 then cstrchr_~c % 256 else cstrchr_~c % 256 - 256); 61#L366-7 assume !!cstrchr_#t~short207;havoc cstrchr_#t~mem206;havoc cstrchr_#t~mem205;havoc cstrchr_#t~short207;cstrchr_#t~post208.base, cstrchr_#t~post208.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post208.base, cstrchr_#t~post208.offset + 1;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset; 54#L366-9 [2018-10-27 06:09:22,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 2 times [2018-10-27 06:09:22,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1620537192, now seen corresponding path program 1 times [2018-10-27 06:09:22,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 318216467, now seen corresponding path program 1 times [2018-10-27 06:09:22,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:22,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:23,050 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-27 06:09:23,348 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-27 06:09:23,836 WARN L179 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-10-27 06:09:23,884 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:23,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:23,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:23,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:23,885 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:23,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:23,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:23,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:23,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrchr_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:09:23,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:23,886 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:23,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:23,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,100 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-10-27 06:09:24,253 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-10-27 06:09:24,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-10-27 06:09:24,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-10-27 06:09:24,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:24,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-10-27 06:09:24,751 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-10-27 06:09:24,769 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:24,774 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:24,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:24,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,783 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-10-27 06:09:24,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:24,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:24,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:24,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:24,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:24,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,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-10-27 06:09:24,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,813 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-10-27 06:09:24,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,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-10-27 06:09:24,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,821 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-10-27 06:09:24,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:24,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:24,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:24,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,833 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-10-27 06:09:24,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,840 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-10-27 06:09:24,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:24,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:24,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:24,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,845 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-10-27 06:09:24,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:24,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:24,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:24,871 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-10-27 06:09:24,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:24,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:24,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:24,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:24,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:24,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:24,985 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:25,047 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:09:25,048 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:09:25,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:25,051 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:25,053 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:25,053 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1 Supporting invariants [] [2018-10-27 06:09:25,108 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-10-27 06:09:25,113 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:09:25,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:25,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:25,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:25,204 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-10-27 06:09:25,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-10-27 06:09:25,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 20 states and 22 transitions. Complement of second has 6 states. [2018-10-27 06:09:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:09:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:09:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-10-27 06:09:25,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 7 letters. [2018-10-27 06:09:25,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:09:25,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 14 letters. [2018-10-27 06:09:25,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:25,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-10-27 06:09:25,246 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:25,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-10-27 06:09:25,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:09:25,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:09:25,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:09:25,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:25,247 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:25,247 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:25,247 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:25,247 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:25,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:25,249 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:09:25,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:09:25,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:25 BoogieIcfgContainer [2018-10-27 06:09:25,254 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:25,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:25,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:25,254 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:25,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:22" (3/4) ... [2018-10-27 06:09:25,258 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:09:25,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:25,258 INFO L168 Benchmark]: Toolchain (without parser) took 4155.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 957.6 MB in the beginning and 837.9 MB in the end (delta: 119.8 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:25,259 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:25,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:25,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -223.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:25,261 INFO L168 Benchmark]: Boogie Preprocessor took 22.36 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-10-27 06:09:25,261 INFO L168 Benchmark]: RCFGBuilder took 531.07 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:25,262 INFO L168 Benchmark]: BuchiAutomizer took 3115.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.9 MB in the end (delta: 291.1 MB). Peak memory consumption was 291.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:25,263 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 837.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:25,269 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.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.22 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 930.7 MB in the beginning and 1.2 GB in the end (delta: -223.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.36 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 531.07 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3115.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.9 MB in the end (delta: 291.1 MB). Peak memory consumption was 291.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 837.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 11 SDslu, 21 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf99 lsp98 ukn83 mio100 lsp32 div141 bol100 ite100 ukn100 eq153 hnf77 smp100 dnf729 smp33 tf100 neg94 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...