./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_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_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/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 5bb7c0b0be083ae28de17688b83fb766e3f101f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:27:39,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:27:39,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:27:39,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:27:39,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:27:39,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:27:39,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:27:39,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:27:39,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:27:39,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:27:39,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:27:39,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:27:39,702 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:27:39,703 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:27:39,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:27:39,704 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:27:39,705 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:27:39,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:27:39,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:27:39,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:27:39,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:27:39,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:27:39,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:27:39,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:27:39,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:27:39,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:27:39,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:27:39,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:27:39,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:27:39,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:27:39,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:27:39,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:27:39,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:27:39,717 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:27:39,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:27:39,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:27:39,718 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 08:27:39,729 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:27:39,730 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:27:39,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:27:39,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:27:39,731 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:27:39,731 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:27:39,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:27:39,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:27:39,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:27:39,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:27:39,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:27:39,733 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:27:39,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:27:39,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:27:39,733 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:27:39,734 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:27:39,734 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_c3297968-3320-4c76-a1fc-db49f6190b03/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 -> 5bb7c0b0be083ae28de17688b83fb766e3f101f5 [2018-12-08 08:27:39,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:27:39,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:27:39,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:27:39,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:27:39,770 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:27:39,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-12-08 08:27:39,809 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/data/8d32cf8ed/037616a024c940eda85e1bab5e964814/FLAG79a7b2b50 [2018-12-08 08:27:40,240 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:27:40,241 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/sv-benchmarks/c/termination-memory-alloca/cstrspn-alloca_true-termination.c.i [2018-12-08 08:27:40,247 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/data/8d32cf8ed/037616a024c940eda85e1bab5e964814/FLAG79a7b2b50 [2018-12-08 08:27:40,255 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/bin-2019/uautomizer/data/8d32cf8ed/037616a024c940eda85e1bab5e964814 [2018-12-08 08:27:40,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:27:40,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:27:40,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:27:40,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:27:40,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:27:40,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cd9e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40, skipping insertion in model container [2018-12-08 08:27:40,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:27:40,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:27:40,426 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:27:40,465 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:27:40,489 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:27:40,508 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:27:40,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40 WrapperNode [2018-12-08 08:27:40,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:27:40,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:27:40,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:27:40,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:27:40,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:27:40,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:27:40,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:27:40,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:27:40,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... [2018-12-08 08:27:40,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:27:40,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:27:40,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:27:40,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:27:40,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3297968-3320-4c76-a1fc-db49f6190b03/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-08 08:27:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:27:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:27:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:27:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:27:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:27:40,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:27:40,726 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:27:40,726 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 08:27:40,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:27:40 BoogieIcfgContainer [2018-12-08 08:27:40,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:27:40,727 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:27:40,727 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:27:40,730 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:27:40,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:27:40,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:27:40" (1/3) ... [2018-12-08 08:27:40,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44d4272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:27:40, skipping insertion in model container [2018-12-08 08:27:40,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:27:40,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:27:40" (2/3) ... [2018-12-08 08:27:40,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44d4272d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:27:40, skipping insertion in model container [2018-12-08 08:27:40,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:27:40,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:27:40" (3/3) ... [2018-12-08 08:27:40,734 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-termination.c.i [2018-12-08 08:27:40,774 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:27:40,775 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:27:40,775 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:27:40,775 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:27:40,775 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:27:40,775 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:27:40,775 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:27:40,775 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:27:40,775 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:27:40,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 08:27:40,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 08:27:40,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:40,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:40,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:27:40,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 08:27:40,807 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:27:40,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-08 08:27:40,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 08:27:40,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:40,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:40,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:27:40,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 08:27:40,815 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 7#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 3#L552-4true [2018-12-08 08:27:40,815 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 5#L557true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 20#L552-3true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 3#L552-4true [2018-12-08 08:27:40,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:40,818 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-08 08:27:40,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:40,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:40,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:40,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-08 08:27:40,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:40,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:40,922 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-08 08:27:40,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:27:40,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 08:27:40,926 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 08:27:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 08:27:40,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 08:27:40,936 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-08 08:27:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:27:40,940 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-08 08:27:40,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 08:27:40,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-08 08:27:40,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 08:27:40,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-08 08:27:40,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-08 08:27:40,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 08:27:40,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-08 08:27:40,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:27:40,945 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 08:27:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-08 08:27:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-08 08:27:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 08:27:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-08 08:27:40,961 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 08:27:40,961 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-08 08:27:40,961 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:27:40,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-08 08:27:40,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-08 08:27:40,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:40,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:40,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 08:27:40,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:27:40,963 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 44#L552-4 [2018-12-08 08:27:40,963 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 56#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 51#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 52#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 55#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 46#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 47#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 44#L552-4 [2018-12-08 08:27:40,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-08 08:27:40,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:40,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:40,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:40,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:40,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-08 08:27:40,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:40,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:27:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-08 08:27:40,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:41,137 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-12-08 08:27:41,273 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-08 08:27:41,411 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-08 08:27:41,478 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:27:41,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:27:41,479 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:27:41,479 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:27:41,479 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:27:41,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:27:41,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:27:41,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:27:41,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-08 08:27:41,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:27:41,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:27:41,494 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-08 08:27:41,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,761 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-08 08:27:41,763 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-08 08:27:41,764 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-08 08:27:41,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,766 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-08 08:27:41,767 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-08 08:27:41,773 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-08 08:27:41,777 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-08 08:27:41,779 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-08 08:27:41,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,781 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-08 08:27:41,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,783 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-08 08:27:41,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,786 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-08 08:27:41,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:41,788 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-08 08:27:41,790 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-08 08:27:41,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:42,102 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:27:42,105 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:27:42,106 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-08 08:27:42,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:42,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:42,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:42,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,110 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-08 08:27:42,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:27:42,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,114 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:27:42,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,126 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-08 08:27:42,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:42,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,130 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-08 08:27:42,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:42,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,138 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-08 08:27:42,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:42,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:42,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:42,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,140 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-08 08:27:42,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:42,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,144 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-08 08:27:42,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:42,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:42,155 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-08 08:27:42,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:42,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:42,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:42,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:42,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:42,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:42,170 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:27:42,184 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:27:42,185 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:27:42,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:27:42,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:27:42,187 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:27:42,187 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-12-08 08:27:42,211 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-08 08:27:42,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:27:42,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:42,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:42,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:42,282 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-08 08:27:42,284 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-08 08:27:42,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 08:27:42,319 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-08 08:27:42,319 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-08 08:27:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 08:27:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-08 08:27:42,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 08:27:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:42,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-08 08:27:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:42,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-08 08:27:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:42,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-08 08:27:42,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:27:42,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-08 08:27:42,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 08:27:42,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-08 08:27:42,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-08 08:27:42,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:27:42,323 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 08:27:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-08 08:27:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-08 08:27:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-08 08:27:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-08 08:27:42,325 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 08:27:42,325 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-08 08:27:42,325 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:27:42,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-08 08:27:42,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:27:42,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:42,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:42,325 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:27:42,325 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:27:42,325 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 178#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 193#L555-5 [2018-12-08 08:27:42,326 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 187#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 188#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 193#L555-5 [2018-12-08 08:27:42,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-08 08:27:42,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-08 08:27:42,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-08 08:27:42,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:42,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:42,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:42,678 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-08 08:27:42,744 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:27:42,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:27:42,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:27:42,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:27:42,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:27:42,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:27:42,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:27:42,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:27:42,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 08:27:42,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:27:42,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:27:42,747 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-08 08:27:42,748 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-08 08:27:42,749 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-08 08:27:42,750 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-08 08:27:42,751 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-08 08:27:42,752 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-08 08:27:42,753 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-08 08:27:42,754 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-08 08:27:42,755 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-08 08:27:42,756 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-08 08:27:42,757 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-08 08:27:42,758 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-08 08:27:42,759 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-08 08:27:42,768 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-08 08:27:42,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:42,935 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-12-08 08:27:42,991 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-08 08:27:42,992 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-08 08:27:42,993 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-08 08:27:42,994 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-08 08:27:42,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:42,996 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-08 08:27:43,336 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:27:43,336 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:27:43,337 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-08 08:27:43,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,338 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-08 08:27:43,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,339 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-08 08:27:43,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,340 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-08 08:27:43,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,342 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-08 08:27:43,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,343 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-08 08:27:43,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,345 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-08 08:27:43,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,347 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-08 08:27:43,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,348 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-08 08:27:43,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,350 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-08 08:27:43,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,351 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-08 08:27:43,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:27:43,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,354 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-08 08:27:43,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,355 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-08 08:27:43,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:43,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:43,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:43,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:27:43,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,357 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:27:43,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,358 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:27:43,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,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-08 08:27:43,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,363 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:27:43,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,364 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:27:43,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:27:43,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,371 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-08 08:27:43,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,374 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-08 08:27:43,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,377 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-08 08:27:43,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,378 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-08 08:27:43,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,379 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:27:43,379 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 08:27:43,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,389 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-12-08 08:27:43,389 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 08:27:43,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,433 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-08 08:27:43,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:43,435 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-08 08:27:43,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:43,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:43,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:43,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:43,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:43,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:43,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:27:43,454 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 08:27:43,454 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 08:27:43,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:27:43,455 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:27:43,455 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:27:43,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-12-08 08:27:43,486 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-08 08:27:43,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:27:43,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:43,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:43,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:43,539 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-08 08:27:43,540 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-08 08:27:43,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-08 08:27:43,575 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-08 08:27:43,575 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-08 08:27:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:27:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 08:27:43,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 08:27:43,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:43,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-08 08:27:43,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:43,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-08 08:27:43,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:43,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-08 08:27:43,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:27:43,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-08 08:27:43,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 08:27:43,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:27:43,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-08 08:27:43,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:27:43,579 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-08 08:27:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-08 08:27:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-08 08:27:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 08:27:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-08 08:27:43,581 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 08:27:43,581 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-08 08:27:43,581 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:27:43,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-08 08:27:43,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:27:43,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:43,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:43,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:27:43,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:27:43,582 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 358#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 359#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 375#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 380#L555-1 assume !cstrspn_#t~short7; 379#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 378#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 363#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 364#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 360#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 362#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 374#L555-5 [2018-12-08 08:27:43,583 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 368#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 369#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 374#L555-5 [2018-12-08 08:27:43,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-08 08:27:43,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:43,621 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-08 08:27:43,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:27:43,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 08:27:43,621 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:27:43,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-08 08:27:43,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:27:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 08:27:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 08:27:43,762 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-08 08:27:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:27:43,819 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-08 08:27:43,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 08:27:43,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-08 08:27:43,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 08:27:43,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-08 08:27:43,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 08:27:43,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:27:43,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-08 08:27:43,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:27:43,821 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-08 08:27:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-08 08:27:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-08 08:27:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 08:27:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-08 08:27:43,823 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-08 08:27:43,823 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-08 08:27:43,823 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:27:43,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-08 08:27:43,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:27:43,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:27:43,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:27:43,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:27:43,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:27:43,824 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 438#L565 assume !(main_~length1~0 < 1); 439#L565-2 assume !(main_~length2~0 < 1); 437#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.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~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, 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; 430#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 431#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 447#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 448#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 450#L555-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6; 449#L555-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 435#L557 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 436#L552-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 432#L552-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 434#L552-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 446#L555-5 [2018-12-08 08:27:43,824 INFO L796 eck$LassoCheckResult]: Loop: 446#L555-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 440#L555-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 441#L555-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 446#L555-5 [2018-12-08 08:27:43,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-08 08:27:43,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:43,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:27:43,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-08 08:27:43,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:43,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:27:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-08 08:27:43,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:27:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:27:43,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:27:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:27:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:27:44,309 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 135 [2018-12-08 08:27:44,853 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-12-08 08:27:44,855 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:27:44,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:27:44,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:27:44,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:27:44,855 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:27:44,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:27:44,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:27:44,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:27:44,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 08:27:44,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:27:44,856 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:27:44,859 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-08 08:27:44,861 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-08 08:27:44,865 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-08 08:27:44,866 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-08 08:27:44,867 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-08 08:27:44,868 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-08 08:27:44,869 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-08 08:27:44,871 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-08 08:27:44,871 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-08 08:27:44,873 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-08 08:27:44,874 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-08 08:27:44,874 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-08 08:27:44,876 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-08 08:27:44,876 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-08 08:27:44,877 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-08 08:27:44,880 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-08 08:27:45,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 08:27:45,452 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-12-08 08:27:45,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:45,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:45,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:45,532 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-08 08:27:45,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:27:45,924 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-12-08 08:27:46,125 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:27:46,125 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:27:46,125 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-08 08:27:46,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,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-08 08:27:46,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:46,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,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-08 08:27:46,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,130 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-08 08:27:46,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:27:46,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,132 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-08 08:27:46,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,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-08 08:27:46,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:46,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,136 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-08 08:27:46,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,137 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-08 08:27:46,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:46,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,139 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-08 08:27:46,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,140 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-08 08:27:46,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,141 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-08 08:27:46,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:46,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,143 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-08 08:27:46,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,144 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-08 08:27:46,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,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-08 08:27:46,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:27:46,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:27:46,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:27:46,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,147 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-08 08:27:46,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,147 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:27:46,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,148 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:27:46,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,152 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-08 08:27:46,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,152 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-12-08 08:27:46,152 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-08 08:27:46,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,174 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-12-08 08:27:46,174 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-08 08:27:46,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:27:46,227 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-08 08:27:46,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:27:46,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:27:46,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:27:46,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:27:46,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:27:46,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:27:46,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:27:46,250 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 08:27:46,250 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 08:27:46,250 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:27:46,251 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:27:46,251 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:27:46,251 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~s2.base)_1 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-12-08 08:27:46,331 INFO L297 tatePredicateManager]: 26 out of 28 supporting invariants were superfluous and have been removed [2018-12-08 08:27:46,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 08:27:46,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,387 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-08 08:27:46,387 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-08 08:27:46,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 08:27:46,413 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-08 08:27:46,413 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-08 08:27:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:27:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 08:27:46,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 08:27:46,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:46,414 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:27:46,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,458 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-08 08:27:46,459 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-08 08:27:46,459 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 08:27:46,485 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-08 08:27:46,485 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-08 08:27:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:27:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 08:27:46,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 08:27:46,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:46,486 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:27:46,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:27:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:27:46,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:27:46,530 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-08 08:27:46,530 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-08 08:27:46,530 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-08 08:27:46,552 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-08 08:27:46,552 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-08 08:27:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:27:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-08 08:27:46,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-08 08:27:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-08 08:27:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:46,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 08:27:46,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:27:46,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-08 08:27:46,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:27:46,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-08 08:27:46,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:27:46,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:27:46,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:27:46,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:27:46,556 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:27:46,556 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:27:46,556 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:27:46,556 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:27:46,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:27:46,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:27:46,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:27:46,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:27:46 BoogieIcfgContainer [2018-12-08 08:27:46,560 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:27:46,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:27:46,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:27:46,561 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:27:46,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:27:40" (3/4) ... [2018-12-08 08:27:46,564 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:27:46,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:27:46,564 INFO L168 Benchmark]: Toolchain (without parser) took 6307.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -146.7 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,565 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:27:46,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,566 INFO L168 Benchmark]: Boogie Preprocessor took 17.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,566 INFO L168 Benchmark]: RCFGBuilder took 172.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,567 INFO L168 Benchmark]: BuchiAutomizer took 5833.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.6 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:27:46,567 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:27:46,569 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5833.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.6 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -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 5.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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, 118 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: inital367 mio100 ax105 hnf99 lsp87 ukn71 mio100 lsp31 div135 bol100 ite100 ukn100 eq165 hnf76 smp92 dnf691 smp24 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 74ms 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...