./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/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 fcd11173df80f9a00fde2714abfd2a4ff8d40757 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:35:10,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:35:10,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:35:10,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:35:10,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:35:10,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:35:10,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:35:10,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:35:10,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:35:10,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:35:10,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:35:10,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:35:10,516 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:35:10,517 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:35:10,518 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:35:10,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:35:10,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:35:10,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:35:10,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:35:10,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:35:10,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:35:10,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:35:10,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:35:10,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:35:10,527 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:35:10,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:35:10,528 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:35:10,529 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:35:10,529 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:35:10,530 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:35:10,530 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:35:10,531 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:35:10,531 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:35:10,531 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:35:10,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:35:10,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:35:10,533 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:35:10,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:35:10,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:35:10,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:35:10,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:35:10,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:35:10,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:35:10,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:35:10,546 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:35:10,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:35:10,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:35:10,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:35:10,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:35:10,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:35:10,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:35:10,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:35:10,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:35:10,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:35:10,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:35:10,550 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_5d4fafd5-bd9f-4950-b892-98178df6c42a/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 -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2018-11-10 10:35:10,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:35:10,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:35:10,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:35:10,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:35:10,585 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:35:10,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-10 10:35:10,623 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/data/600d5fce9/f74bd2b893bb4318a69e0dbe54f63d30/FLAGd64ba3cdb [2018-11-10 10:35:11,005 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:35:11,005 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-10 10:35:11,012 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/data/600d5fce9/f74bd2b893bb4318a69e0dbe54f63d30/FLAGd64ba3cdb [2018-11-10 10:35:11,021 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/data/600d5fce9/f74bd2b893bb4318a69e0dbe54f63d30 [2018-11-10 10:35:11,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:35:11,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:35:11,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:11,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:35:11,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:35:11,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604393ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11, skipping insertion in model container [2018-11-10 10:35:11,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:35:11,071 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:35:11,286 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:11,292 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:35:11,326 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:35:11,357 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:35:11,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11 WrapperNode [2018-11-10 10:35:11,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:35:11,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:35:11,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:35:11,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:35:11,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:35:11,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:35:11,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:35:11,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:35:11,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... [2018-11-10 10:35:11,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:35:11,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:35:11,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:35:11,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:35:11,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/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-11-10 10:35:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:35:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:35:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:35:11,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:35:11,709 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:35:11,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:11 BoogieIcfgContainer [2018-11-10 10:35:11,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:35:11,711 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:35:11,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:35:11,714 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:35:11,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:35:11,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:35:11" (1/3) ... [2018-11-10 10:35:11,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e7ef6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:35:11, skipping insertion in model container [2018-11-10 10:35:11,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:35:11,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:35:11" (2/3) ... [2018-11-10 10:35:11,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e7ef6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:35:11, skipping insertion in model container [2018-11-10 10:35:11,716 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:35:11,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:11" (3/3) ... [2018-11-10 10:35:11,717 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-10 10:35:11,754 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:35:11,754 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:35:11,754 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:35:11,754 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:35:11,754 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:35:11,755 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:35:11,755 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:35:11,755 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:35:11,755 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:35:11,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 10:35:11,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 10:35:11,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:11,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:11,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,786 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:35:11,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 10:35:11,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 10:35:11,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:11,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:11,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,794 INFO L793 eck$LassoCheckResult]: Stem: 22#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_~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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 12#L391true assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 4#L369-5true [2018-11-10 10:35:11,794 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 15#L369-1true SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 17#L369-2true assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 10#L371true SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 11#L371-1true cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-9true assume !true; 21#L372-10true SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 3#L369-4true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset + 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 4#L369-5true [2018-11-10 10:35:11,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 10:35:11,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:11,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:11,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:11,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 10:35:11,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:11,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:11,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:11,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:11,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:11,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:35:11,932 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:35:11,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:35:11,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:35:11,946 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 10:35:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:11,952 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 10:35:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:35:11,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 10:35:11,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 10:35:11,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 10:35:11,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 10:35:11,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 10:35:11,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 10:35:11,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:35:11,958 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 10:35:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 10:35:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 10:35:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 10:35:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 10:35:11,975 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 10:35:11,975 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 10:35:11,975 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:35:11,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 10:35:11,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 10:35:11,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:11,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:11,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:11,976 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_~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(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 82#L391 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 68#L369-5 [2018-11-10 10:35:11,976 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 78#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 81#L372-3 assume !cstrcspn_#t~short210; 64#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 65#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 67#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset + 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 68#L369-5 [2018-11-10 10:35:11,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 10:35:11,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:11,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:11,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:11,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 10:35:12,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:12,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:12,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:35:12,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1600668446, now seen corresponding path program 1 times [2018-11-10 10:35:12,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:12,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:12,196 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-10 10:35:12,437 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-11-10 10:35:12,555 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-10 10:35:12,563 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:35:12,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:35:12,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:35:12,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:35:12,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:35:12,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:35:12,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:35:12,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:35:12,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 10:35:12,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:35:12,566 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:35:12,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,807 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-10 10:35:12,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,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-11-10 10:35:12,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-11-10 10:35:12,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,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-11-10 10:35:12,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:12,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:13,271 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:35:13,275 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:35:13,277 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-11-10 10:35:13,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:13,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,283 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-11-10 10:35:13,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,288 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-11-10 10:35:13,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:13,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,290 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-11-10 10:35:13,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,293 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,310 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-11-10 10:35:13,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,315 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-11-10 10:35:13,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,316 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:35:13,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,321 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:35:13,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,334 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-11-10 10:35:13,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:13,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:13,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:13,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:13,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:35:13,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,364 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:35:13,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:13,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:13,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:13,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,380 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-11-10 10:35:13,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:13,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:13,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:13,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,382 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-11-10 10:35:13,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:13,386 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-11-10 10:35:13,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:13,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:13,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:13,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:13,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:13,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:13,421 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:35:13,439 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 10:35:13,439 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 10:35:13,441 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:35:13,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:35:13,443 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:35:13,444 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-10 10:35:13,469 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 10:35:13,477 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:35:13,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:13,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:13,545 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-11-10 10:35:13,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 10:35:13,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 38 states and 45 transitions. Complement of second has 6 states. [2018-11-10 10:35:13,591 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-11-10 10:35:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:35:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 10:35:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 10:35:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 10:35:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 10:35:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:13,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-11-10 10:35:13,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:13,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 42 transitions. [2018-11-10 10:35:13,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 10:35:13,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 10:35:13,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-10 10:35:13,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:35:13,597 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 10:35:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-10 10:35:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 10:35:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 10:35:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-10 10:35:13,599 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 10:35:13,600 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 10:35:13,600 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:35:13,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-10 10:35:13,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:13,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:13,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:13,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:13,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:35:13,601 INFO L793 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 263#L382 assume !(main_~length1~0 < 1); 264#L382-2 assume !(main_~length2~0 < 1); 260#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; 261#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 277#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 274#L391 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 254#L369-5 assume true; 256#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 278#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 266#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 267#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 248#L372-9 [2018-11-10 10:35:13,601 INFO L795 eck$LassoCheckResult]: Loop: 248#L372-9 assume true; 258#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 270#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 272#L372-3 assume !cstrcspn_#t~short210; 247#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset + 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 248#L372-9 [2018-11-10 10:35:13,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 10:35:13,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:13,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:13,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 10:35:13,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:13,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:13,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:13,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:35:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:35:13,643 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:35:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:35:13,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:35:13,643 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 10:35:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:35:13,657 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-10 10:35:13,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:35:13,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-10 10:35:13,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:13,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-11-10 10:35:13,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 10:35:13,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 10:35:13,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-10 10:35:13,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:35:13,660 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 10:35:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-10 10:35:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 10:35:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 10:35:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-10 10:35:13,664 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 10:35:13,664 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 10:35:13,665 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:35:13,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-10 10:35:13,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:13,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:13,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:13,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:13,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:13,668 INFO L793 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 340#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 341#L382 assume !(main_~length1~0 < 1); 342#L382-2 assume !(main_~length2~0 < 1); 338#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; 339#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 355#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 352#L391 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 331#L369-5 assume true; 332#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 356#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 344#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 345#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 326#L372-9 [2018-11-10 10:35:13,668 INFO L795 eck$LassoCheckResult]: Loop: 326#L372-9 assume true; 335#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 348#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 350#L372-3 assume cstrcspn_#t~short210; 353#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 358#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 325#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset + 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 326#L372-9 [2018-11-10 10:35:13,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 10:35:13,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:13,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 10:35:13,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:13,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:13,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:35:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 10:35:13,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:13,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:14,064 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2018-11-10 10:35:14,147 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:35:14,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:35:14,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:35:14,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:35:14,147 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:35:14,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:35:14,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:35:14,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:35:14,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 10:35:14,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:35:14,147 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:35:14,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,401 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-11-10 10:35:14,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:35:14,928 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 10:35:15,013 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:35:15,013 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:35:15,013 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-11-10 10:35:15,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:15,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:15,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:15,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,016 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-11-10 10:35:15,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:15,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:15,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:15,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,022 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-11-10 10:35:15,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,025 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-11-10 10:35:15,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:15,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:15,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:15,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,027 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-11-10 10:35:15,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:15,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:15,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:15,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,029 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-11-10 10:35:15,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:35:15,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:35:15,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:35:15,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:35:15,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,034 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-11-10 10:35:15,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,037 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-11-10 10:35:15,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,040 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-11-10 10:35:15,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,046 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-11-10 10:35:15,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,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-11-10 10:35:15,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,060 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-11-10 10:35:15,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,060 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:35:15,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:35:15,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,072 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-11-10 10:35:15,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,076 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-11-10 10:35:15,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,079 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-11-10 10:35:15,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,080 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:35:15,080 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-10 10:35:15,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,103 INFO L402 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2018-11-10 10:35:15,103 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-10 10:35:15,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,208 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-11-10 10:35:15,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,211 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-11-10 10:35:15,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,214 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-11-10 10:35:15,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,214 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:35:15,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,215 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:35:15,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:35:15,221 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-11-10 10:35:15,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:35:15,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:35:15,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:35:15,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:35:15,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:35:15,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:35:15,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:35:15,254 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:35:15,254 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 10:35:15,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:35:15,255 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:35:15,255 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:35:15,255 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-10 10:35:15,312 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 10:35:15,314 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:35:15,314 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:35:15,315 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 10:35:15,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:15,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:15,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:15,412 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-11-10 10:35:15,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 10:35:15,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 89 states and 100 transitions. Complement of second has 10 states. [2018-11-10 10:35:15,484 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-11-10 10:35:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:35:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 10:35:15,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 10:35:15,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:15,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 10:35:15,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:15,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 10:35:15,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:35:15,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 100 transitions. [2018-11-10 10:35:15,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:15,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 62 states and 70 transitions. [2018-11-10 10:35:15,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 10:35:15,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 10:35:15,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2018-11-10 10:35:15,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:35:15,488 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 10:35:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2018-11-10 10:35:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-11-10 10:35:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 10:35:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 10:35:15,493 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 10:35:15,493 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 10:35:15,493 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:35:15,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions. [2018-11-10 10:35:15,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:35:15,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:35:15,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:35:15,495 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] [2018-11-10 10:35:15,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:35:15,495 INFO L793 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 633#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 634#L382 assume !(main_~length1~0 < 1); 635#L382-2 assume !(main_~length2~0 < 1); 631#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; 632#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 648#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 645#L391 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 623#L369-5 assume true; 624#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 668#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 667#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 665#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 655#L372-9 assume true; 663#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 666#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 664#L372-3 assume !cstrcspn_#t~short210; 619#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 620#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 627#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 621#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset + 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 622#L369-5 assume true; 625#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 649#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 636#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 637#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 618#L372-9 [2018-11-10 10:35:15,495 INFO L795 eck$LassoCheckResult]: Loop: 618#L372-9 assume true; 628#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 640#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 643#L372-3 assume cstrcspn_#t~short210; 646#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 651#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 617#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset + 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 618#L372-9 [2018-11-10 10:35:15,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2009458362, now seen corresponding path program 2 times [2018-11-10 10:35:15,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:15,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:15,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:15,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 10:35:15,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:15,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:15,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:35:15,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:35:15,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:35:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1050967218, now seen corresponding path program 1 times [2018-11-10 10:35:15,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:35:15,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:35:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:35:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:35:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:15,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:35:15,609 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d4fafd5-bd9f-4950-b892-98178df6c42a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:35:15,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:35:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:35:15,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:35:15,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 10:35:15,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:35:15,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:15,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:15,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:35:15,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 10:35:32,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:35:32,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:35:32,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:35:32,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:32,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:35:32,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 10:35:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:35:32,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:35:32,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2018-11-10 10:35:32,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:35:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=175, Unknown=2, NotChecked=0, Total=210 [2018-11-10 10:35:32,817 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-11-10 10:35:45,853 WARN L179 SmtUtils]: Spent 12.94 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-11-10 10:35:50,642 WARN L179 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-11-10 10:36:46,879 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-10 10:37:01,558 WARN L179 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 10:37:24,505 WARN L179 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-10 10:37:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:24,511 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-10 10:37:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:37:24,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 121 transitions. [2018-11-10 10:37:24,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:37:24,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 88 states and 98 transitions. [2018-11-10 10:37:24,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 10:37:24,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 10:37:24,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2018-11-10 10:37:24,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:37:24,548 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-10 10:37:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2018-11-10 10:37:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-11-10 10:37:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 10:37:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-10 10:37:24,552 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 10:37:24,552 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 10:37:24,552 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:37:24,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-11-10 10:37:24,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 10:37:24,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:24,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:24,554 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-11-10 10:37:24,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:24,554 INFO L793 eck$LassoCheckResult]: Stem: 940#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 935#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 936#L382 assume !(main_~length1~0 < 1); 937#L382-2 assume !(main_~length2~0 < 1); 932#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; 933#L390 SUMMARY for call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 951#L390-1 SUMMARY for call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L390-1 948#L391 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 924#L369-5 assume true; 925#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 966#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 943#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 944#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 965#L372-9 assume true; 976#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 974#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 970#L372-3 assume cstrcspn_#t~short210; 969#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 956#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 957#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 934#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 928#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 922#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset + 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 923#L369-5 assume true; 926#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 954#L369-2 assume !!(cstrcspn_#t~mem206 != 49);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 941#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 942#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 919#L372-9 [2018-11-10 10:37:24,554 INFO L795 eck$LassoCheckResult]: Loop: 919#L372-9 assume true; 929#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 938#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 49; 945#L372-3 assume cstrcspn_#t~short210; 949#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 952#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 918#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset + 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 919#L372-9 [2018-11-10 10:37:24,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 1 times [2018-11-10 10:37:24,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:24,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:24,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 3 times [2018-11-10 10:37:24,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:24,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:24,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 10:37:24,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:24,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:25,099 WARN L179 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 147 [2018-11-10 10:37:25,719 WARN L179 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2018-11-10 10:37:25,721 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:25,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:25,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:25,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:25,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:37:25,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:25,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:25,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:25,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 10:37:25,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:25,721 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:25,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:25,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:25,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:25,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:25,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:25,904 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 10:37:26,419 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2018-11-10 10:37:26,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:26,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:27,344 WARN L179 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-10 10:37:27,453 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 10:37:27,462 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:27,462 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:37:27,463 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-11-10 10:37:27,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:27,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:27,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,465 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-11-10 10:37:27,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:27,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:27,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:27,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,467 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-11-10 10:37:27,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:27,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:27,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:27,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,469 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-11-10 10:37:27,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,472 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-11-10 10:37:27,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,479 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-11-10 10:37:27,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:27,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,486 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-11-10 10:37:27,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,486 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:37:27,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,488 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:27,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:27,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,500 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-11-10 10:37:27,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,505 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-11-10 10:37:27,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,509 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,509 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-11-10 10:37:27,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,514 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-11-10 10:37:27,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:27,517 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-11-10 10:37:27,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:27,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:27,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:27,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:27,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:27,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:37:27,535 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:37:27,561 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 10:37:27,561 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 10:37:27,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:37:27,562 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:37:27,562 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:37:27,564 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-10 10:37:27,656 INFO L297 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2018-11-10 10:37:27,657 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:37:27,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:37:27,658 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 10:37:27,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:27,729 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-11-10 10:37:27,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 10:37:27,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 92 states and 104 transitions. Complement of second has 10 states. [2018-11-10 10:37:27,798 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-11-10 10:37:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:37:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 10:37:27,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 10:37:27,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:37:27,799 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:37:27,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:27,857 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-11-10 10:37:27,857 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 10:37:27,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 92 states and 104 transitions. Complement of second has 10 states. [2018-11-10 10:37:27,896 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-11-10 10:37:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:37:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 10:37:27,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 10:37:27,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:37:27,897 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:37:27,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:27,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:37:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:27,957 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-11-10 10:37:27,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-10 10:37:28,006 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 7 states. Result 99 states and 114 transitions. Complement of second has 9 states. [2018-11-10 10:37:28,007 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-11-10 10:37:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 10:37:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2018-11-10 10:37:28,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 10:37:28,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:37:28,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 10:37:28,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:37:28,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 10:37:28,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:37:28,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 114 transitions. [2018-11-10 10:37:28,011 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:37:28,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-11-10 10:37:28,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:37:28,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:37:28,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:37:28,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:28,011 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:37:28,012 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:37:28,012 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:37:28,012 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:37:28,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:37:28,012 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:37:28,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:37:28,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:37:28 BoogieIcfgContainer [2018-11-10 10:37:28,017 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:37:28,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:37:28,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:37:28,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:37:28,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:35:11" (3/4) ... [2018-11-10 10:37:28,020 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:37:28,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:37:28,021 INFO L168 Benchmark]: Toolchain (without parser) took 136996.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -301.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,022 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:37:28,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.12 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 923.1 MB in the beginning and 1.2 GB in the end (delta: -261.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,022 INFO L168 Benchmark]: Boogie Preprocessor took 18.53 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,023 INFO L168 Benchmark]: RCFGBuilder took 236.48 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,023 INFO L168 Benchmark]: BuchiAutomizer took 136306.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -97.8 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:28,024 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:37:28,026 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.12 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.1 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 923.1 MB in the beginning and 1.2 GB in the end (delta: -261.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.53 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: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 236.48 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 136306.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -97.8 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 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 unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 136.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 23.7s. Construction of modules took 20.1s. Büchi inclusion checks took 92.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 198 SDtfs, 381 SDslu, 310 SDs, 0 SdLazy, 266 SolverSat, 45 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 20.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital348 mio100 ax100 hnf99 lsp91 ukn91 mio100 lsp31 div115 bol100 ite100 ukn100 eq183 hnf82 smp87 dnf763 smp55 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 128ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 140 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...