./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/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 0c74f0cc26425c1a044a70e86941b5dd82b132ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:04,545 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:04,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:04,558 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:04,559 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:04,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:04,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:04,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:04,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:04,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:04,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:04,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:04,564 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:04,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:04,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:04,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:04,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:04,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:04,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:04,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:04,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:04,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:04,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:04,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:04,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:04,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:04,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:04,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:04,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:04,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:04,590 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:04,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:04,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:04,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:04,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:04,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:04,592 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:07:04,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:04,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:04,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:04,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:04,613 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:04,613 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:04,614 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:04,614 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:04,614 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:04,614 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:04,615 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:04,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:04,615 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:04,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:04,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:04,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:04,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:04,616 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:04,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:04,617 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:04,617 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:04,617 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:04,618 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_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/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 -> 0c74f0cc26425c1a044a70e86941b5dd82b132ff [2018-10-27 06:07:04,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:04,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:04,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:04,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:04,676 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:04,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-10-27 06:07:04,728 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/data/3a49a5d8a/ef548ee861f34540b420a66b14f522e5/FLAG107b44885 [2018-10-27 06:07:05,100 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:05,100 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/sv-benchmarks/c/termination-crafted-lit/cstrspn_true-termination_true-no-overflow.c [2018-10-27 06:07:05,107 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/data/3a49a5d8a/ef548ee861f34540b420a66b14f522e5/FLAG107b44885 [2018-10-27 06:07:05,118 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/data/3a49a5d8a/ef548ee861f34540b420a66b14f522e5 [2018-10-27 06:07:05,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:05,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:05,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:05,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:05,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:05,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570cef64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05, skipping insertion in model container [2018-10-27 06:07:05,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:05,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:05,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:05,292 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:05,303 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:05,316 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:05,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05 WrapperNode [2018-10-27 06:07:05,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:05,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:05,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:05,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:05,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:05,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:05,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:05,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:05,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... [2018-10-27 06:07:05,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:05,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:05,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:05,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:05,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88e8de1c-a8f4-4a6c-8bd3-f6b0d7e07c9c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:07:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:05,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:07:05,945 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:05,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:05 BoogieIcfgContainer [2018-10-27 06:07:05,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:05,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:05,946 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:05,950 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:05,951 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:05,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:05" (1/3) ... [2018-10-27 06:07:05,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54809684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:05, skipping insertion in model container [2018-10-27 06:07:05,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:05,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:05" (2/3) ... [2018-10-27 06:07:05,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54809684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:05, skipping insertion in model container [2018-10-27 06:07:05,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:05,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:05" (3/3) ... [2018-10-27 06:07:05,955 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_true-termination_true-no-overflow.c [2018-10-27 06:07:06,002 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:06,003 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:06,003 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:06,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:06,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:06,003 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:06,003 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:06,003 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:06,003 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:06,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:07:06,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:06,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:06,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:06,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,044 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:06,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:07:06,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:06,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:06,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:06,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,055 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 20#L14true assume !(build_nondet_String_~length~0 < 1); 17#L14-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 8#L18true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 7#L18-1true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 27#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 14#L14-3true assume !(build_nondet_String_~length~0 < 1); 29#L14-5true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 5#L18-2true SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 3#L18-3true build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 25#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 4#L31-5true [2018-10-27 06:07:06,055 INFO L795 eck$LassoCheckResult]: Loop: 4#L31-5true assume true; 10#L31-1true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 9#L31-2true assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 32#L33true SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 31#L33-1true cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 34#L34-9true assume !true; 33#L34-10true SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-10 22#L36true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 6#L31-4true 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, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 4#L31-5true [2018-10-27 06:07:06,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 1 times [2018-10-27 06:07:06,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:06,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 883669989, now seen corresponding path program 1 times [2018-10-27 06:07:06,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:06,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:06,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:06,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:06,228 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:06,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:07:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:07:06,243 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-27 06:07:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:06,250 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-10-27 06:07:06,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:07:06,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2018-10-27 06:07:06,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:06,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 31 transitions. [2018-10-27 06:07:06,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-10-27 06:07:06,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-10-27 06:07:06,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-10-27 06:07:06,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:06,260 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:07:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-10-27 06:07:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-27 06:07:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 06:07:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-27 06:07:06,287 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:07:06,287 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-27 06:07:06,287 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:06,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-10-27 06:07:06,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:07:06,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:06,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:06,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:06,292 INFO L793 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 87#L14 assume !(build_nondet_String_~length~0 < 1); 92#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 80#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 78#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 79#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 89#L14-3 assume !(build_nondet_String_~length~0 < 1); 90#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 76#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 72#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 73#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 74#L31-5 [2018-10-27 06:07:06,292 INFO L795 eck$LassoCheckResult]: Loop: 74#L31-5 assume true; 75#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 81#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 82#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 98#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 95#L34-9 assume true; 91#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 88#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 83#L34-3 assume !cstrspn_#t~short7; 84#L34-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 94#L34-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-10 93#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 77#L31-4 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, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 74#L31-5 [2018-10-27 06:07:06,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 2 times [2018-10-27 06:07:06,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:06,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash 311113554, now seen corresponding path program 1 times [2018-10-27 06:07:06,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:06,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:06,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:06,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:07:06,605 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:06,605 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:07:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:07,152 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-27 06:07:07,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:07:07,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2018-10-27 06:07:07,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:07,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 37 transitions. [2018-10-27 06:07:07,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-10-27 06:07:07,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-10-27 06:07:07,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-10-27 06:07:07,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:07,158 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-27 06:07:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-10-27 06:07:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-27 06:07:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 06:07:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-27 06:07:07,162 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 06:07:07,162 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 06:07:07,163 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:07,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2018-10-27 06:07:07,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:07:07,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:07,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:07,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:07,169 INFO L793 eck$LassoCheckResult]: Stem: 191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 180#L14 assume !(build_nondet_String_~length~0 < 1); 185#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 173#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 171#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 172#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 182#L14-3 assume !(build_nondet_String_~length~0 < 1); 183#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 169#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 165#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 166#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 167#L31-5 [2018-10-27 06:07:07,169 INFO L795 eck$LassoCheckResult]: Loop: 167#L31-5 assume true; 168#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 174#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 175#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 190#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 187#L34-9 assume true; 184#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 181#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 176#L34-3 assume cstrspn_#t~short7; 178#L34-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-4 188#L34-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 189#L34-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 192#L34-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-10 186#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 170#L31-4 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, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 167#L31-5 [2018-10-27 06:07:07,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1755105166, now seen corresponding path program 3 times [2018-10-27 06:07:07,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1134451409, now seen corresponding path program 1 times [2018-10-27 06:07:07,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:07,240 INFO L82 PathProgramCache]: Analyzing trace with hash 689254914, now seen corresponding path program 1 times [2018-10-27 06:07:07,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:07,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:07,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:07,831 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-27 06:07:07,997 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 06:07:08,359 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 122 [2018-10-27 06:07:08,508 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:07:08,528 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:08,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:08,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:08,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:08,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:08,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:08,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:08,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:08,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-10-27 06:07:08,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:08,531 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:08,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,842 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-10-27 06:07:08,965 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-10-27 06:07:08,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:08,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:09,544 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:09,549 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:09,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:09,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:09,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:09,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:09,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:09,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:09,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:09,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,606 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:09,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:09,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:09,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:09,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:09,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:09,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:09,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:09,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:09,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:09,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:09,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:09,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:09,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:09,752 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:07:09,753 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:07:09,754 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:09,756 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:09,756 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:09,756 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-10-27 06:07:09,861 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-10-27 06:07:09,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:07:09,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:09,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:09,955 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:07:09,956 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:07:10,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 32 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 44 states and 51 transitions. Complement of second has 6 states. [2018-10-27 06:07:10,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:07:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-10-27 06:07:10,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 15 letters. [2018-10-27 06:07:10,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:10,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 27 letters. Loop has 15 letters. [2018-10-27 06:07:10,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:10,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 31 transitions. Stem has 12 letters. Loop has 30 letters. [2018-10-27 06:07:10,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:10,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2018-10-27 06:07:10,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:07:10,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 48 transitions. [2018-10-27 06:07:10,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:07:10,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-10-27 06:07:10,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2018-10-27 06:07:10,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:10,037 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-10-27 06:07:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2018-10-27 06:07:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-27 06:07:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-27 06:07:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-10-27 06:07:10,040 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-10-27 06:07:10,040 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-10-27 06:07:10,040 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:10,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2018-10-27 06:07:10,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:10,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:10,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:10,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:10,045 INFO L793 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 389#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 390#L14 assume !(build_nondet_String_~length~0 < 1); 403#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 384#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 382#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 383#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 399#L14-3 assume !(build_nondet_String_~length~0 < 1); 400#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 380#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 374#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 375#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 376#L31-5 assume true; 378#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 385#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 386#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 410#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 405#L34-9 [2018-10-27 06:07:10,045 INFO L795 eck$LassoCheckResult]: Loop: 405#L34-9 assume true; 401#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 397#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 391#L34-3 assume !cstrspn_#t~short7; 392#L34-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;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, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 405#L34-9 [2018-10-27 06:07:10,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,046 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 1 times [2018-10-27 06:07:10,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash 66864142, now seen corresponding path program 1 times [2018-10-27 06:07:10,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:10,130 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:10,130 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:07:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:10,159 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-10-27 06:07:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:10,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 46 transitions. [2018-10-27 06:07:10,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:10,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 44 transitions. [2018-10-27 06:07:10,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:07:10,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:07:10,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 44 transitions. [2018-10-27 06:07:10,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:10,163 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:07:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 44 transitions. [2018-10-27 06:07:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-27 06:07:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-27 06:07:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-10-27 06:07:10,165 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:07:10,165 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-27 06:07:10,165 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:10,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2018-10-27 06:07:10,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:10,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:10,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:10,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:10,167 INFO L793 eck$LassoCheckResult]: Stem: 497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 480#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 481#L14 assume !(build_nondet_String_~length~0 < 1); 488#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 471#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 469#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 470#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 485#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 467#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 461#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 462#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 463#L31-5 assume true; 465#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 472#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 473#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 498#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 491#L34-9 [2018-10-27 06:07:10,167 INFO L795 eck$LassoCheckResult]: Loop: 491#L34-9 assume true; 486#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 482#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 476#L34-3 assume cstrspn_#t~short7; 477#L34-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-4 495#L34-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 490#L34-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;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, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 491#L34-9 [2018-10-27 06:07:10,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,167 INFO L82 PathProgramCache]: Analyzing trace with hash 556795412, now seen corresponding path program 2 times [2018-10-27 06:07:10,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 1 times [2018-10-27 06:07:10,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:10,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 462232030, now seen corresponding path program 1 times [2018-10-27 06:07:10,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:10,848 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 140 [2018-10-27 06:07:10,974 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-27 06:07:10,982 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:10,982 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:10,982 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:10,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:10,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:10,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:10,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:10,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:10,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration5_Lasso [2018-10-27 06:07:10,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:10,983 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:10,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:10,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-10-27 06:07:10,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-10-27 06:07:10,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-10-27 06:07:10,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-10-27 06:07:10,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:10,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,331 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2018-10-27 06:07:11,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:11,987 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:07:12,026 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:12,026 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:12,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:12,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:12,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:12,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:12,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:12,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:12,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:12,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:12,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:12,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:12,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:12,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:12,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:12,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:12,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:12,101 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:12,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:12,133 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:07:12,133 INFO L444 ModelExtractionUtils]: 45 out of 49 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:12,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:12,134 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:12,134 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:12,135 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-10-27 06:07:12,407 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:07:12,426 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:07:12,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:07:12,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:07:12,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:12,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:12,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:12,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:07:12,573 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-10-27 06:07:12,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 90 states and 98 transitions. Complement of second has 11 states. [2018-10-27 06:07:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:07:12,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 7 letters. [2018-10-27 06:07:12,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:12,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 24 letters. Loop has 7 letters. [2018-10-27 06:07:12,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:12,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 17 letters. Loop has 14 letters. [2018-10-27 06:07:12,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:12,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 98 transitions. [2018-10-27 06:07:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:12,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 64 states and 70 transitions. [2018-10-27 06:07:12,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:07:12,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:07:12,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 70 transitions. [2018-10-27 06:07:12,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:07:12,683 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-10-27 06:07:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 70 transitions. [2018-10-27 06:07:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-27 06:07:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:07:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-27 06:07:12,686 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-27 06:07:12,687 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-27 06:07:12,687 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:12,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 61 transitions. [2018-10-27 06:07:12,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:07:12,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:12,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:12,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:12,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:12,691 INFO L793 eck$LassoCheckResult]: Stem: 789#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 771#L14 assume !(build_nondet_String_~length~0 < 1); 778#L14-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 760#L18 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18 758#L18-1 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 759#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 774#L14-3 assume !(build_nondet_String_~length~0 < 1); 775#L14-5 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := build_nondet_String_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset; 756#L18-2 SUMMARY for call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1) * 1, 1); srcloc: L18-2 749#L18-3 build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 750#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 751#L31-5 assume true; 752#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 763#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 764#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 787#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 788#L34-9 assume true; 777#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 773#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 768#L34-3 assume cstrspn_#t~short7; 769#L34-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-4 785#L34-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 782#L34-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7; 783#L34-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-10 779#L36 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 757#L31-4 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, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 753#L31-5 assume true; 755#L31-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L31-1 761#L31-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 762#L33 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L33 786#L33-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 781#L34-9 [2018-10-27 06:07:12,691 INFO L795 eck$LassoCheckResult]: Loop: 781#L34-9 assume true; 776#L34-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-1 772#L34-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 766#L34-3 assume cstrspn_#t~short7; 767#L34-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L34-4 784#L34-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 780#L34-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem5;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;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, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 781#L34-9 [2018-10-27 06:07:12,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1822686176, now seen corresponding path program 2 times [2018-10-27 06:07:12,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,725 INFO L82 PathProgramCache]: Analyzing trace with hash -168195247, now seen corresponding path program 2 times [2018-10-27 06:07:12,725 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1008039506, now seen corresponding path program 1 times [2018-10-27 06:07:12,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:12,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,875 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:07:13,581 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 180 [2018-10-27 06:07:14,373 WARN L179 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 124 [2018-10-27 06:07:14,375 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:14,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:14,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:14,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:14,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:14,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:14,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:14,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:14,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-10-27 06:07:14,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:14,376 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:14,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,501 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:07:15,228 WARN L179 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2018-10-27 06:07:15,361 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-10-27 06:07:15,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:16,100 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-10-27 06:07:16,202 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:07:16,308 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:16,309 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:16,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:16,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,311 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:16,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,317 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:16,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,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-10-27 06:07:16,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:07:16,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:16,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,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-10-27 06:07:16,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,392 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-10-27 06:07:16,392 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:07:16,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,422 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-10-27 06:07:16,423 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-10-27 06:07:16,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,567 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:16,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:16,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:07:16,606 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:07:16,666 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:07:16,677 INFO L444 ModelExtractionUtils]: 63 out of 67 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:07:16,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:07:16,678 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:07:16,678 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:07:16,678 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 Supporting invariants [] [2018-10-27 06:07:17,104 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-10-27 06:07:17,105 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:07:17,105 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:07:17,105 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:07:17,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:17,222 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:07:17,222 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:07:17,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-10-27 06:07:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:07:17,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:07:17,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:17,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:17,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:17,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:07:17,483 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:07:17,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 84 states and 90 transitions. Complement of second has 11 states. [2018-10-27 06:07:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-10-27 06:07:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 32 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:07:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:17,568 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:07:17,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:17,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:07:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:17,663 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2018-10-27 06:07:17,663 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-10-27 06:07:17,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 61 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 89 states and 96 transitions. Complement of second has 10 states. [2018-10-27 06:07:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:07:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:07:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-10-27 06:07:17,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 7 letters. [2018-10-27 06:07:17,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:17,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 39 letters. Loop has 7 letters. [2018-10-27 06:07:17,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:17,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 32 letters. Loop has 14 letters. [2018-10-27 06:07:17,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:07:17,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 96 transitions. [2018-10-27 06:07:17,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:17,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 0 states and 0 transitions. [2018-10-27 06:07:17,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:07:17,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:07:17,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:07:17,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:17,797 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:17,798 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:17,798 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:07:17,798 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:17,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:07:17,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:07:17,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:07:17,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:17 BoogieIcfgContainer [2018-10-27 06:07:17,803 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:17,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:17,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:17,804 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:17,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:05" (3/4) ... [2018-10-27 06:07:17,811 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:07:17,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:17,813 INFO L168 Benchmark]: Toolchain (without parser) took 12687.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -267.0 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,814 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:17,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.40 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,815 INFO L168 Benchmark]: Boogie Preprocessor took 27.18 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,815 INFO L168 Benchmark]: RCFGBuilder took 564.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -220.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,816 INFO L168 Benchmark]: BuchiAutomizer took 11857.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -64.4 MB). Peak memory consumption was 129.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:17,816 INFO L168 Benchmark]: Witness Printer took 7.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:17,819 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.40 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 942.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.39 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 939.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.18 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 564.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 937.0 MB in the beginning and 1.2 GB in the end (delta: -220.1 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11857.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 194.0 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -64.4 MB). Peak memory consumption was 129.6 MB. Max. memory is 11.5 GB. * Witness Printer took 7.82 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 8 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 8 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 206 SDtfs, 264 SDslu, 257 SDs, 0 SdLazy, 292 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital392 mio100 ax100 hnf99 lsp91 ukn84 mio100 lsp28 div124 bol100 ite100 ukn100 eq168 hnf82 smp97 dnf570 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 164ms 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...