./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/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 9c357a0f089ccce134e4135f49c3923f49db9d7a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 03:08:21,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:08:21,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:08:21,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:08:21,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:08:21,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:08:21,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:08:21,547 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:08:21,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:08:21,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:08:21,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:08:21,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:08:21,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:08:21,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:08:21,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:08:21,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:08:21,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:08:21,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:08:21,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:08:21,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:08:21,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:08:21,556 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:08:21,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:08:21,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:08:21,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:08:21,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:08:21,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:08:21,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:08:21,560 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:08:21,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:08:21,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:08:21,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:08:21,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:08:21,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:08:21,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:08:21,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:08:21,563 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 03:08:21,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:08:21,571 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:08:21,571 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:08:21,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:08:21,572 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 03:08:21,572 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 03:08:21,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:08:21,573 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 03:08:21,574 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:08:21,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 03:08:21,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:08:21,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:08:21,574 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 03:08:21,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:08:21,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:08:21,575 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 03:08:21,575 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 03:08:21,575 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_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/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 -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2018-12-02 03:08:21,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:08:21,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:08:21,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:08:21,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:08:21,603 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:08:21,603 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-12-02 03:08:21,638 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/data/9d88379a7/7e0a79fe1d7f487d91474c070569ed57/FLAG455e0e598 [2018-12-02 03:08:22,119 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:08:22,120 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-12-02 03:08:22,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/data/9d88379a7/7e0a79fe1d7f487d91474c070569ed57/FLAG455e0e598 [2018-12-02 03:08:22,133 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/bin-2019/uautomizer/data/9d88379a7/7e0a79fe1d7f487d91474c070569ed57 [2018-12-02 03:08:22,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:08:22,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:08:22,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:08:22,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:08:22,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:08:22,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79574bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22, skipping insertion in model container [2018-12-02 03:08:22,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:08:22,160 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:08:22,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:22,317 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:08:22,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:22,426 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:08:22,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22 WrapperNode [2018-12-02 03:08:22,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:08:22,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:08:22,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:08:22,427 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:08:22,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:08:22,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:08:22,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:08:22,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:08:22,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... [2018-12-02 03:08:22,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:08:22,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:08:22,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:08:22,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:08:22,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3d3c777-5666-4ff9-8fc2-edc9af8c5df1/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-12-02 03:08:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:08:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:08:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:08:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 03:08:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:08:22,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:08:22,654 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:08:22,655 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 03:08:22,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:22 BoogieIcfgContainer [2018-12-02 03:08:22,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:08:22,655 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 03:08:22,655 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 03:08:22,658 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 03:08:22,658 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:08:22,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:08:22" (1/3) ... [2018-12-02 03:08:22,659 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15623223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:08:22, skipping insertion in model container [2018-12-02 03:08:22,659 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:08:22,659 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:22" (2/3) ... [2018-12-02 03:08:22,660 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15623223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:08:22, skipping insertion in model container [2018-12-02 03:08:22,660 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:08:22,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:22" (3/3) ... [2018-12-02 03:08:22,661 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2018-12-02 03:08:22,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:08:22,694 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 03:08:22,694 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 03:08:22,694 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 03:08:22,694 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:08:22,694 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:08:22,695 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 03:08:22,695 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:08:22,695 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 03:08:22,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 03:08:22,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 03:08:22,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:22,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:22,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 03:08:22,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 03:08:22,721 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 03:08:22,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 03:08:22,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 03:08:22,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:22,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:22,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 03:08:22,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 03:08:22,727 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2018-12-02 03:08:22,727 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2018-12-02 03:08:22,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 03:08:22,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:22,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-02 03:08:22,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:22,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:22,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:22,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:08:22,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:08:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 03:08:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 03:08:22,848 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 03:08:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:22,852 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-02 03:08:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 03:08:22,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-02 03:08:22,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 03:08:22,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-02 03:08:22,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 03:08:22,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 03:08:22,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-02 03:08:22,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:08:22,858 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 03:08:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-02 03:08:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 03:08:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 03:08:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-02 03:08:22,874 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 03:08:22,874 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-02 03:08:22,874 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 03:08:22,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-02 03:08:22,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 03:08:22,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:22,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:22,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 03:08:22,875 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:22,875 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2018-12-02 03:08:22,875 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2018-12-02 03:08:22,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-02 03:08:22,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-02 03:08:22,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:22,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:22,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-02 03:08:22,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:23,081 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-12-02 03:08:23,247 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-02 03:08:23,383 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-02 03:08:23,448 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:08:23,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:08:23,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:08:23,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:08:23,449 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:08:23,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:08:23,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:08:23,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:08:23,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration2_Lasso [2018-12-02 03:08:23,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:08:23,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:08:23,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:23,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,108 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:08:24,112 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:08:24,113 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-12-02 03:08:24,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:24,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:24,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:24,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,117 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-12-02 03:08:24,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:24,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:24,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:24,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,119 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-12-02 03:08:24,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,124 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-12-02 03:08:24,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:24,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:24,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:24,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,127 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-12-02 03:08:24,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:24,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:24,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:24,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,129 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-12-02 03:08:24,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,133 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-12-02 03:08:24,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,146 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-12-02 03:08:24,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,147 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:08:24,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,149 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:08:24,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:08:24,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,161 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:08:24,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,163 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:08:24,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,176 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-12-02 03:08:24,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:24,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:24,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:24,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,179 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-12-02 03:08:24,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,183 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-12-02 03:08:24,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,188 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-12-02 03:08:24,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:24,193 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-12-02 03:08:24,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:24,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:24,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:24,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:24,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:24,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:24,216 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:08:24,239 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 03:08:24,239 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 03:08:24,240 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:08:24,241 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:08:24,241 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:08:24,242 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 Supporting invariants [] [2018-12-02 03:08:24,276 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-02 03:08:24,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:08:24,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:24,341 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-12-02 03:08:24,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 03:08:24,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-02 03:08:24,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:08:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 03:08:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-02 03:08:24,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 03:08:24,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:24,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-02 03:08:24,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:24,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-02 03:08:24,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:24,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-02 03:08:24,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 03:08:24,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-02 03:08:24,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 03:08:24,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 03:08:24,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 03:08:24,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:08:24,400 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 03:08:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 03:08:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 03:08:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 03:08:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-02 03:08:24,402 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 03:08:24,402 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 03:08:24,402 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 03:08:24,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-02 03:08:24,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 03:08:24,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:24,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:24,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:24,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 03:08:24,404 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 186#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 187#L382 assume !(main_~length1~0 < 1); 188#L382-2 assume !(main_~length2~0 < 1); 185#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 182#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 184#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 194#L372-5 [2018-12-02 03:08:24,404 INFO L796 eck$LassoCheckResult]: Loop: 194#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 189#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 190#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 194#L372-5 [2018-12-02 03:08:24,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-02 03:08:24,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:24,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:24,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-02 03:08:24,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-02 03:08:24,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:24,739 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2018-12-02 03:08:24,810 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:08:24,810 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:08:24,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:08:24,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:08:24,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:08:24,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:08:24,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:08:24,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:08:24,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2018-12-02 03:08:24,811 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:08:24,811 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:08:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:24,994 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-12-02 03:08:25,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:25,412 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-02 03:08:25,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:08:25,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:08:25,481 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-12-02 03:08:25,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,483 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-12-02 03:08:25,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,485 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-12-02 03:08:25,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,487 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-12-02 03:08:25,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,488 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-12-02 03:08:25,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:25,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:25,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,491 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-12-02 03:08:25,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,492 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-12-02 03:08:25,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,494 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-12-02 03:08:25,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:25,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:25,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,496 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-12-02 03:08:25,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:25,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:25,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:25,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:25,498 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-12-02 03:08:25,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:25,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:25,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:25,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:25,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:25,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:25,512 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:08:25,523 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 03:08:25,523 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 03:08:25,524 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:08:25,524 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:08:25,525 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:08:25,525 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-02 03:08:25,570 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-12-02 03:08:25,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:08:25,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:25,613 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:08:25,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-02 03:08:25,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-02 03:08:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:08:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:08:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 03:08:25,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-02 03:08:25,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:25,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-02 03:08:25,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:25,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-02 03:08:25,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:25,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-02 03:08:25,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 03:08:25,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-02 03:08:25,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 03:08:25,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 03:08:25,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-02 03:08:25,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:08:25,646 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-02 03:08:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-02 03:08:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-02 03:08:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 03:08:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-02 03:08:25,648 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 03:08:25,649 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-02 03:08:25,649 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 03:08:25,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-02 03:08:25,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 03:08:25,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:25,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:25,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:25,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 03:08:25,650 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 376#L382 assume !(main_~length1~0 < 1); 377#L382-2 assume !(main_~length2~0 < 1); 374#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 370#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 371#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 384#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 380#L372-1 assume !cstrspn_#t~short210; 381#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 366#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 367#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 368#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 369#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 373#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 383#L372-5 [2018-12-02 03:08:25,650 INFO L796 eck$LassoCheckResult]: Loop: 383#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 378#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 379#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 383#L372-5 [2018-12-02 03:08:25,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-02 03:08:25,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:25,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:25,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:25,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 03:08:25,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:08:25,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,689 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-02 03:08:25,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:25,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 03:08:25,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 03:08:25,798 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-02 03:08:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:25,844 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-02 03:08:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 03:08:25,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-02 03:08:25,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 03:08:25,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-02 03:08:25,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 03:08:25,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 03:08:25,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-02 03:08:25,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 03:08:25,846 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-02 03:08:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-02 03:08:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-02 03:08:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 03:08:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-02 03:08:25,847 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 03:08:25,847 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-02 03:08:25,847 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 03:08:25,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-02 03:08:25,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 03:08:25,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:08:25,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:08:25,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:25,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 03:08:25,848 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 448#L382 assume !(main_~length1~0 < 1); 449#L382-2 assume !(main_~length2~0 < 1); 446#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 442#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 443#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 456#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 460#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 459#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210; 438#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 439#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 440#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, 1 + cstrspn_#t~post205.offset;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 441#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 445#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 455#L372-5 [2018-12-02 03:08:25,848 INFO L796 eck$LassoCheckResult]: Loop: 455#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 451#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 452#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, 1 + cstrspn_#t~post211.offset;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 455#L372-5 [2018-12-02 03:08:25,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-02 03:08:25,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:25,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-02 03:08:25,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-02 03:08:25,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:08:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:08:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:08:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:26,402 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 137 [2018-12-02 03:08:26,996 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-12-02 03:08:26,997 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:08:26,998 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:08:26,998 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:08:26,998 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:08:26,998 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:08:26,998 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:08:26,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:08:26,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:08:26,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2018-12-02 03:08:26,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:08:26,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:08:27,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 03:08:27,651 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-12-02 03:08:27,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:27,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:08:28,126 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-12-02 03:08:28,359 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:08:28,360 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:08:28,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-12-02 03:08:28,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,362 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-12-02 03:08:28,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,364 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-12-02 03:08:28,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:28,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:28,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,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-12-02 03:08:28,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,367 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-12-02 03:08:28,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,369 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-12-02 03:08:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,370 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-12-02 03:08:28,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:08:28,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:08:28,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:08:28,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,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-12-02 03:08:28,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,372 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-02 03:08:28,372 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-02 03:08:28,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,389 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-12-02 03:08:28,390 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-02 03:08:28,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,455 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-12-02 03:08:28,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,456 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 03:08:28,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,457 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:08:28,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:28,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,461 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-12-02 03:08:28,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:28,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:28,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,464 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-12-02 03:08:28,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:28,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:28,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:08:28,468 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-12-02 03:08:28,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:08:28,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:08:28,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:08:28,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:08:28,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:08:28,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 03:08:28,480 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 03:08:28,490 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 03:08:28,490 INFO L444 ModelExtractionUtils]: 53 out of 58 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 03:08:28,491 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 03:08:28,491 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 03:08:28,491 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 03:08:28,492 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-02 03:08:28,586 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-12-02 03:08:28,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 03:08:28,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:28,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:08:28,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 03:08:28,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 03:08:28,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:08:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:08:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 03:08:28,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 03:08:28,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:28,654 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 03:08:28,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:28,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:08:28,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 03:08:28,728 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-02 03:08:28,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:08:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:08:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 03:08:28,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 03:08:28,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:28,729 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 03:08:28,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:08:28,775 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 03:08:28,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 03:08:28,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-12-02 03:08:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 03:08:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 03:08:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 03:08:28,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-02 03:08:28,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:28,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-02 03:08:28,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:28,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-02 03:08:28,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 03:08:28,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-02 03:08:28,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:08:28,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-02 03:08:28,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 03:08:28,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 03:08:28,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 03:08:28,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:08:28,798 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:08:28,798 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:08:28,798 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 03:08:28,798 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 03:08:28,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 03:08:28,799 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 03:08:28,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 03:08:28,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:08:28 BoogieIcfgContainer [2018-12-02 03:08:28,802 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 03:08:28,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:08:28,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:08:28,803 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:08:28,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:22" (3/4) ... [2018-12-02 03:08:28,805 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 03:08:28,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:08:28,806 INFO L168 Benchmark]: Toolchain (without parser) took 6670.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 957.1 MB in the beginning and 832.8 MB in the end (delta: 124.3 MB). Peak memory consumption was 442.0 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:28,806 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:28,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:28,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:28,807 INFO L168 Benchmark]: Boogie Preprocessor took 21.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:28,807 INFO L168 Benchmark]: RCFGBuilder took 175.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:28,807 INFO L168 Benchmark]: BuchiAutomizer took 6147.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 832.8 MB in the end (delta: 268.3 MB). Peak memory consumption was 442.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:28,808 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.3 GB. Free memory is still 832.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:28,809 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -162.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 175.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6147.20 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 174.6 MB). Free memory was 1.1 GB in the beginning and 832.8 MB in the end (delta: 268.3 MB). Peak memory consumption was 442.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.3 GB. Free memory is still 832.8 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[malloc(length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length2 * sizeof(char))] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 122 SDslu, 72 SDs, 0 SdLazy, 103 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp32 div133 bol100 ite100 ukn100 eq171 hnf76 smp96 dnf623 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 83ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...