./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9c357a0f089ccce134e4135f49c3923f49db9d7a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:01,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:01,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:01,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:01,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:01,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:01,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:01,111 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:01,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:01,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:01,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:01,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:01,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:01,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:01,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:01,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:01,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:01,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:01,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:01,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:01,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:01,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:01,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:01,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:01,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:01,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:01,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:01,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:01,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:01,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:01,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:01,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:01,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:01,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:01,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:01,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:01,132 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:01,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:01,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:01,146 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:01,146 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:01,146 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:01,147 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:01,147 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:01,147 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:01,147 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:01,147 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:01,147 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:01,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:01,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:01,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:01,150 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:01,150 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:01,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:01,151 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:01,151 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:01,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:01,151 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:01,151 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:01,152 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:01,152 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_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c357a0f089ccce134e4135f49c3923f49db9d7a [2018-10-27 06:10:01,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:01,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:01,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:01,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:01,190 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:01,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-10-27 06:10:01,235 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/data/10282f60e/aebd35e31c5a423cbe8f121dcf4465e2/FLAGffe249c95 [2018-10-27 06:10:01,662 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:01,665 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/sv-benchmarks/c/termination-15/cstrspn_malloc_true-termination.c.i [2018-10-27 06:10:01,674 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/data/10282f60e/aebd35e31c5a423cbe8f121dcf4465e2/FLAGffe249c95 [2018-10-27 06:10:01,690 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/bin-2019/uautomizer/data/10282f60e/aebd35e31c5a423cbe8f121dcf4465e2 [2018-10-27 06:10:01,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:01,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:01,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:01,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:01,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:01,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:01" (1/1) ... [2018-10-27 06:10:01,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17af8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:01, skipping insertion in model container [2018-10-27 06:10:01,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:01" (1/1) ... [2018-10-27 06:10:01,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:01,742 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:01,983 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:01,992 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:02,028 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:02,089 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:02,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02 WrapperNode [2018-10-27 06:10:02,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:02,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:02,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:02,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:02,098 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:10:02" (1/1) ... [2018-10-27 06:10:02,109 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:10:02" (1/1) ... [2018-10-27 06:10:02,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:02,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:02,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:02,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:02,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... [2018-10-27 06:10:02,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:02,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:02,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:02,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:02,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_be2fd0fa-4998-4892-9b48-139ea0bbbe91/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:10:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:02,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:02,616 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:02,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:02 BoogieIcfgContainer [2018-10-27 06:10:02,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:02,617 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:02,617 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:02,620 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:02,621 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:02,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:01" (1/3) ... [2018-10-27 06:10:02,622 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a12df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:02, skipping insertion in model container [2018-10-27 06:10:02,622 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:02,622 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:02" (2/3) ... [2018-10-27 06:10:02,623 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a12df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:02, skipping insertion in model container [2018-10-27 06:10:02,623 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:02,623 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:02" (3/3) ... [2018-10-27 06:10:02,624 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn_malloc_true-termination.c.i [2018-10-27 06:10:02,669 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:02,669 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:02,670 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:02,670 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:02,670 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:02,670 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:02,670 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:02,670 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:02,670 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:02,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:10:02,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:10:02,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:02,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:02,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,706 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:02,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:10:02,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:10:02,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:02,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:02,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,717 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 9#L382true assume !(main_~length1~0 < 1); 13#L382-2true assume !(main_~length2~0 < 1); 7#L385-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 12#L391true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 4#L369-5true [2018-10-27 06:10:02,717 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 15#L369-1true SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 17#L369-2true assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 10#L371true SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 11#L371-1true cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 3#L369-4true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 4#L369-5true [2018-10-27 06:10:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:10:02,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:02,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:02,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:02,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:10:02,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:02,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:02,892 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:10:02,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:02,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:02,899 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:10:02,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:10:02,915 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:10:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:02,922 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:10:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:10:02,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:10:02,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:10:02,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:10:02,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:10:02,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:10:02,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:10:02,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:02,931 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:10:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:10:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:10:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:10:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:10:02,951 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:10:02,951 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:10:02,951 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:02,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:10:02,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:10:02,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:02,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:02,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:02,953 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 82#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 68#L369-5 [2018-10-27 06:10:02,953 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 78#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 81#L372-3 assume !cstrspn_#t~short210; 64#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 65#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 67#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 68#L369-5 [2018-10-27 06:10:02,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:10:02,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:02,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:02,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:02,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:02,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:10:02,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:02,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:03,371 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:10:03,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:03,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-27 06:10:03,372 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:03,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:10:03,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:10:03,373 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-10-27 06:10:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:03,790 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-27 06:10:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:10:03,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-10-27 06:10:03,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:10:03,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-10-27 06:10:03,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:10:03,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:10:03,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-10-27 06:10:03,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:03,795 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-27 06:10:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-10-27 06:10:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-27 06:10:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:10:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 06:10:03,798 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:10:03,798 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 06:10:03,798 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:03,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-10-27 06:10:03,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-10-27 06:10:03,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:03,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:03,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:03,800 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:10:03,800 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 167#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 152#L369-5 [2018-10-27 06:10:03,801 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 162#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 166#L372-3 assume cstrspn_#t~short210; 168#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 172#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 158#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 151#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 152#L369-5 [2018-10-27 06:10:03,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:03,801 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:10:03,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:03,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:03,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-10-27 06:10:03,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-10-27 06:10:03,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:03,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:04,319 WARN L179 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-27 06:10:04,486 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-10-27 06:10:04,722 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:10:04,830 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:04,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:04,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:04,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:04,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:04,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:04,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:04,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:04,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:10:04,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:04,832 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:04,850 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:10:04,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:04,881 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:10:04,882 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:10:04,885 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:10:04,887 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:10:04,888 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:10:04,890 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:10:04,895 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:10:04,896 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:10:04,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:04,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:05,224 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-10-27 06:10:05,368 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-10-27 06:10:05,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:10:05,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:10:05,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:10:05,373 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:10:05,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:10:05,375 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:10:05,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:10:05,915 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:05,919 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:05,921 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:10:05,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,927 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:10:05,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,932 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:10:05,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,934 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:10:05,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:05,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:05,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,942 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:10:05,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,951 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:10:05,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,954 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:10:05,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:05,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:05,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,961 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:10:05,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,964 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:10:05,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,973 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:10:05,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,975 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:10:05,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:05,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:05,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:05,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:05,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:05,978 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:10:05,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:05,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:05,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:05,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:05,981 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:05,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,002 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:10:06,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,006 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:10:06,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,024 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:10:06,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,039 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:10:06,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,045 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:10:06,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:06,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:10:06,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:06,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:06,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:06,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:06,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:06,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:06,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:06,183 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:06,183 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:06,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:06,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:06,188 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:06,189 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1, ULTIMATE.start_cstrspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrspn_~sc1~0.offset Supporting invariants [] [2018-10-27 06:10:06,283 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:10:06,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:06,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:06,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:06,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:06,394 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:10:06,396 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:10:06,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-10-27 06:10:06,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 40 states and 47 transitions. Complement of second has 6 states. [2018-10-27 06:10:06,429 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:10:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:10:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-10-27 06:10:06,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-10-27 06:10:06,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:06,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-10-27 06:10:06,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:06,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-10-27 06:10:06,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:06,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-10-27 06:10:06,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:06,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-10-27 06:10:06,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:10:06,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:10:06,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-10-27 06:10:06,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:06,435 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-10-27 06:10:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-10-27 06:10:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-27 06:10:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:10:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-10-27 06:10:06,438 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:10:06,438 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-10-27 06:10:06,438 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:06,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-10-27 06:10:06,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:06,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:06,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:06,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:06,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:10:06,440 INFO L793 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 357#L382 assume !(main_~length1~0 < 1); 358#L382-2 assume !(main_~length2~0 < 1); 353#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 354#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 371#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 368#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 347#L369-5 assume true; 349#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 374#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 362#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 363#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 342#L372-9 [2018-10-27 06:10:06,440 INFO L795 eck$LassoCheckResult]: Loop: 342#L372-9 assume true; 351#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 359#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 366#L372-3 assume !cstrspn_#t~short210; 341#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 342#L372-9 [2018-10-27 06:10:06,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:10:06,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:10:06,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:06,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:06,517 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:10:06,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:06,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:10:06,517 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:06,518 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:10:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:06,538 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-10-27 06:10:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:06,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-10-27 06:10:06,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:06,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-10-27 06:10:06,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:10:06,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:10:06,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-10-27 06:10:06,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:06,540 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:10:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-10-27 06:10:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:10:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:10:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-10-27 06:10:06,542 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:10:06,542 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-10-27 06:10:06,542 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:06,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-10-27 06:10:06,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:06,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:06,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:06,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:06,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:06,543 INFO L793 eck$LassoCheckResult]: Stem: 444#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 436#L382 assume !(main_~length1~0 < 1); 437#L382-2 assume !(main_~length2~0 < 1); 433#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 434#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 450#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 447#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 427#L369-5 assume true; 429#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 451#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 438#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 439#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 421#L372-9 [2018-10-27 06:10:06,544 INFO L795 eck$LassoCheckResult]: Loop: 421#L372-9 assume true; 431#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 442#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 445#L372-3 assume cstrspn_#t~short210; 448#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 453#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 420#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 421#L372-9 [2018-10-27 06:10:06,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:10:06,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:10:06,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:10:06,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:06,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:07,027 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2018-10-27 06:10:07,215 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-27 06:10:07,216 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:07,217 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:07,217 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:07,217 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:07,217 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:07,217 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:07,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:07,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:07,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:10:07,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:07,217 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:07,222 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:10:07,226 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:10:07,227 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:10:07,228 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:10:07,230 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:10:07,232 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:10:07,234 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:10:07,542 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 95 [2018-10-27 06:10:07,637 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:10:07,639 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:10:07,641 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:10:07,642 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:10:07,644 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:10:07,645 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:10:07,646 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:10:07,647 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:10:07,649 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:10:07,650 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:10:07,652 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:10:07,653 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:10:07,654 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:10:08,063 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-10-27 06:10:08,193 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:10:08,251 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:08,252 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:08,252 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:10:08,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,254 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:10:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,256 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:10:08,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,257 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:10:08,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,259 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:10:08,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,262 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:10:08,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,263 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:10:08,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,267 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:10:08,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,270 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:10:08,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,270 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:08,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,272 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:08,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,281 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:10:08,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,285 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:10:08,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,289 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:10:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,316 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:08,349 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:08,349 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:10:08,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:08,350 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:08,350 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:08,350 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:10:08,462 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-10-27 06:10:08,463 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:10:08,463 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:08,464 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:10:08,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:08,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:08,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:08,603 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:10:08,603 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:08,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-10-27 06:10:08,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-10-27 06:10:08,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:10:08,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:10:08,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:08,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:10:08,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:08,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:10:08,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:08,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-10-27 06:10:08,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:08,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-10-27 06:10:08,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:10:08,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:10:08,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-10-27 06:10:08,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:08,675 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-27 06:10:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-10-27 06:10:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-10-27 06:10:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:10:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-27 06:10:08,678 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:10:08,678 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-27 06:10:08,678 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:08,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-10-27 06:10:08,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:08,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:08,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:08,680 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] [2018-10-27 06:10:08,680 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:08,680 INFO L793 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 716#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 717#L382 assume !(main_~length1~0 < 1); 718#L382-2 assume !(main_~length2~0 < 1); 714#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 715#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 734#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 731#L391 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 706#L369-5 assume true; 707#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 747#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 746#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 727#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 728#L372-9 assume true; 744#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 743#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 742#L372-3 assume cstrspn_#t~short210; 741#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 740#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 702#L372-7 assume !cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209; 703#L372-10 SUMMARY for call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-10 710#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 704#L369-4 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset + 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 705#L369-5 assume true; 709#L369-1 SUMMARY for call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L369-1 737#L369-2 assume !!(cstrspn_#t~mem206 != 0);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 719#L371 SUMMARY for call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L371 720#L371-1 cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 701#L372-9 [2018-10-27 06:10:08,680 INFO L795 eck$LassoCheckResult]: Loop: 701#L372-9 assume true; 711#L372-1 SUMMARY for call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-1 723#L372-2 cstrspn_#t~short210 := cstrspn_#t~mem208 != 0; 729#L372-3 assume cstrspn_#t~short210; 732#L372-4 SUMMARY for call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L372-4 735#L372-5 cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 700#L372-7 assume !!cstrspn_#t~short210;havoc cstrspn_#t~mem208;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset + 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 701#L372-9 [2018-10-27 06:10:08,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-10-27 06:10:08,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:08,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:08,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:08,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:10:08,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:08,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:10:08,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:08,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:08,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:08,868 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:10:09,377 WARN L179 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 147 [2018-10-27 06:10:10,183 WARN L179 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 117 [2018-10-27 06:10:10,185 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:10,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:10,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:10,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:10,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:10,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:10,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:10,186 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:10,186 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_malloc_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:10:10,186 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:10,186 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:10,192 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:10:10,200 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:10:10,202 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:10:10,204 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:10:10,209 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:10:10,214 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:10:10,215 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:10:10,216 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:10:10,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:10,272 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:10:10,273 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:10:10,274 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:10:10,275 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:10:10,277 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:10:10,278 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:10:10,279 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:10:10,422 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:10:11,042 WARN L179 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 115 [2018-10-27 06:10:11,189 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-27 06:10:11,189 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:10:11,191 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:10:11,192 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:10:11,565 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-10-27 06:10:11,980 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-10-27 06:10:12,120 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:12,120 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:12,121 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:10:12,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,123 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:10:12,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:12,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:12,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:12,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,145 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:10:12,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:12,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,148 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:10:12,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,163 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:10:12,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,164 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:10:12,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,167 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:10:12,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,169 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:10:12,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,170 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:10:12,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,172 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:10:12,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:12,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:12,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:12,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,189 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:10:12,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,191 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:10:12,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,195 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:10:12,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,198 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:10:12,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,198 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:12,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,199 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:12,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:12,217 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:10:12,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:12,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:12,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:12,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:12,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:12,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:12,240 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:12,260 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:12,260 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:10:12,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:12,262 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:12,262 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:12,262 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:10:12,868 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2018-10-27 06:10:12,869 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:10:12,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:12,869 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:10:12,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:12,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:12,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:12,978 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:10:12,978 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:12,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:10:13,032 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:10:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:10:13,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:13,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:13,033 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:13,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:13,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:13,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:13,092 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:10:13,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:13,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:10:13,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-10-27 06:10:13,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-10-27 06:10:13,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:13,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:13,144 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:13,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:13,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:13,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:13,224 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:10:13,224 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:13,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:10:13,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-10-27 06:10:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-10-27 06:10:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:10:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:10:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:13,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:10:13,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:13,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:10:13,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:13,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:13,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:13,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:13,314 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:13,314 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:13,314 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:13,314 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:13,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:13,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:13,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:13,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:13 BoogieIcfgContainer [2018-10-27 06:10:13,324 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:13,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:13,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:13,324 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:13,326 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:02" (3/4) ... [2018-10-27 06:10:13,329 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:13,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:13,329 INFO L168 Benchmark]: Toolchain (without parser) took 11634.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 393.2 MB). Free memory was 957.0 MB in the beginning and 913.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 436.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,330 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:13,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.44 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 930.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 930.1 MB in the beginning and 1.2 GB in the end (delta: -269.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,332 INFO L168 Benchmark]: Boogie Preprocessor took 25.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,332 INFO L168 Benchmark]: RCFGBuilder took 399.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,332 INFO L168 Benchmark]: BuchiAutomizer took 10706.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.2 GB in the beginning and 913.4 MB in the end (delta: 252.7 MB). Peak memory consumption was 444.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:13,335 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 1.4 GB. Free memory is still 913.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:13,339 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.44 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 930.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 930.1 MB in the beginning and 1.2 GB in the end (delta: -269.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10706.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.4 MB). Free memory was 1.2 GB in the beginning and 913.4 MB in the end (delta: 252.7 MB). Peak memory consumption was 444.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.76 ms. Allocated memory is still 1.4 GB. Free memory is still 913.4 MB. 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 unknown-#length-unknown[sc1] + -1 * sc1 and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. 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 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 190 SDtfs, 244 SDslu, 225 SDs, 0 SdLazy, 213 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital383 mio100 ax100 hnf99 lsp91 ukn83 mio100 lsp30 div122 bol100 ite100 ukn100 eq175 hnf82 smp97 dnf559 smp26 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...