./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/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 f39f60c3148e6a8957b92a35d12d506fd8229368 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:35:47,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:35:47,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:35:47,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:35:47,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:35:47,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:35:47,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:35:47,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:35:47,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:35:47,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:35:47,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:35:47,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:35:47,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:35:47,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:35:47,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:35:47,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:35:47,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:35:47,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:35:47,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:35:47,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:35:47,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:35:47,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:35:47,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:35:47,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:35:47,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:35:47,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:35:47,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:35:47,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:35:47,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:35:47,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:35:47,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:35:47,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:35:47,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:35:47,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:35:47,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:35:47,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:35:47,548 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:35:47,556 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:35:47,556 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:35:47,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:35:47,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:35:47,557 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:35:47,557 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:35:47,557 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:35:47,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:35:47,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:35:47,559 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:35:47,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:35:47,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:35:47,560 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:35:47,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:35:47,560 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:35:47,560 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:35:47,561 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:35:47,561 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_8433c2c5-f4dd-4157-8929-5c0b7c685f11/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 -> f39f60c3148e6a8957b92a35d12d506fd8229368 [2018-11-18 08:35:47,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:35:47,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:35:47,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:35:47,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:35:47,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:35:47,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-18 08:35:47,637 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/data/ca50a8923/c6ea01ed252f4a62a2b2461147bf21ad/FLAGea9412307 [2018-11-18 08:35:48,060 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:35:48,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-18 08:35:48,066 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/data/ca50a8923/c6ea01ed252f4a62a2b2461147bf21ad/FLAGea9412307 [2018-11-18 08:35:48,078 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/bin-2019/uautomizer/data/ca50a8923/c6ea01ed252f4a62a2b2461147bf21ad [2018-11-18 08:35:48,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:35:48,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:35:48,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:48,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:35:48,085 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:35:48,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263ee91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48, skipping insertion in model container [2018-11-18 08:35:48,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:35:48,112 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:35:48,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:48,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:35:48,251 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:35:48,262 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:35:48,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48 WrapperNode [2018-11-18 08:35:48,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:35:48,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:48,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:35:48,263 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:35:48,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:35:48,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:35:48,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:35:48,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:35:48,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... [2018-11-18 08:35:48,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:35:48,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:35:48,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:35:48,344 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:35:48,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/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-18 08:35:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:35:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:35:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:35:48,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:35:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:35:48,551 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:35:48,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:48 BoogieIcfgContainer [2018-11-18 08:35:48,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:35:48,551 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:35:48,551 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:35:48,554 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:35:48,554 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:48,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:35:48" (1/3) ... [2018-11-18 08:35:48,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@547750b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:48, skipping insertion in model container [2018-11-18 08:35:48,555 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:48,555 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:48" (2/3) ... [2018-11-18 08:35:48,555 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@547750b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:35:48, skipping insertion in model container [2018-11-18 08:35:48,556 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:35:48,556 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:48" (3/3) ... [2018-11-18 08:35:48,557 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-11-18 08:35:48,594 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:35:48,594 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:35:48,594 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:35:48,595 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:35:48,595 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:35:48,595 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:35:48,595 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:35:48,595 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:35:48,595 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:35:48,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 08:35:48,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:35:48,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:48,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:48,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,630 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:35:48,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-18 08:35:48,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:35:48,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:48,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:48,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,637 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 23#L14true assume !(build_nondet_String_~length~0 < 1); 19#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 11#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 18#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 3#L30-4true [2018-11-18 08:35:48,638 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 9#L30-1true assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 5#L33-6true assume !true; 4#L33-7true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 21#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 6#L30-3true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 3#L30-4true [2018-11-18 08:35:48,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-18 08:35:48,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:48,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:48,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:48,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1602865194, now seen corresponding path program 1 times [2018-11-18 08:35:48,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:48,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:48,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:48,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:48,766 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-18 08:35:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:48,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 08:35:48,770 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 08:35:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 08:35:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 08:35:48,780 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-18 08:35:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:48,785 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2018-11-18 08:35:48,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 08:35:48,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-18 08:35:48,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:35:48,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 21 transitions. [2018-11-18 08:35:48,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 08:35:48,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 08:35:48,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-18 08:35:48,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:48,791 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:35:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-18 08:35:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 08:35:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 08:35:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 08:35:48,808 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:35:48,808 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 08:35:48,808 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:35:48,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 08:35:48,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 08:35:48,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:48,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:48,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:48,810 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 66#L14 assume !(build_nondet_String_~length~0 < 1); 68#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 61#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 62#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 63#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 59#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 52#L30-4 [2018-11-18 08:35:48,810 INFO L796 eck$LassoCheckResult]: Loop: 52#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 53#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 56#L33-6 assume true; 57#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 64#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 60#L33-4 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 54#L33-7 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 55#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 58#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 52#L30-4 [2018-11-18 08:35:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-18 08:35:48,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:48,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:48,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1362530394, now seen corresponding path program 1 times [2018-11-18 08:35:48,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:48,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:48,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:48,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:48,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -517253763, now seen corresponding path program 1 times [2018-11-18 08:35:48,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:48,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:48,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:49,070 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-18 08:35:49,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 08:35:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 08:35:49,184 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-18 08:35:49,351 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-18 08:35:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 08:35:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 08:35:49,352 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-18 08:35:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:35:49,482 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-18 08:35:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:35:49,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-18 08:35:49,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 08:35:49,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 08:35:49,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 08:35:49,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-18 08:35:49,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-18 08:35:49,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:35:49,486 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 08:35:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-18 08:35:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-18 08:35:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 08:35:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-18 08:35:49,488 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 08:35:49,488 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 08:35:49,488 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:35:49,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-18 08:35:49,489 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-18 08:35:49,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:49,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:49,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:49,490 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:49,490 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 139#L14 assume !(build_nondet_String_~length~0 < 1); 146#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 134#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 135#L14-3 assume !(build_nondet_String_~length~0 < 1); 136#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 137#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 123#L30-4 [2018-11-18 08:35:49,490 INFO L796 eck$LassoCheckResult]: Loop: 123#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 124#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 132#L33-6 assume true; 143#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 144#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 148#L33-4 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 125#L33-7 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 126#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 147#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 123#L30-4 [2018-11-18 08:35:49,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-18 08:35:49,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:49,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:49,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1362530394, now seen corresponding path program 2 times [2018-11-18 08:35:49,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:49,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash -259088325, now seen corresponding path program 1 times [2018-11-18 08:35:49,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:49,685 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-18 08:35:49,809 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-18 08:35:50,008 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-11-18 08:35:50,094 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:50,095 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:50,095 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:50,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:50,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:50,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:50,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:50,096 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:50,096 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-18 08:35:50,096 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:50,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:50,109 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-18 08:35:50,112 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-18 08:35:50,113 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-18 08:35:50,114 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-18 08:35:50,116 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-18 08:35:50,118 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-18 08:35:50,284 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-11-18 08:35:50,386 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-18 08:35:50,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:50,389 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-18 08:35:50,390 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-18 08:35:50,391 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-18 08:35:50,393 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-18 08:35:50,395 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-18 08:35:50,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:50,397 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-18 08:35:50,397 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-18 08:35:50,398 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-18 08:35:50,652 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2018-11-18 08:35:50,759 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:50,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:50,763 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-18 08:35:50,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:50,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,769 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-18 08:35:50,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:50,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,771 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-18 08:35:50,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:50,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,773 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-18 08:35:50,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:50,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,775 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-18 08:35:50,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,781 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-18 08:35:50,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,782 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-18 08:35:50,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,786 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:35:50,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,797 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-18 08:35:50,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,801 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-18 08:35:50,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,816 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-18 08:35:50,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,826 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-18 08:35:50,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,827 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:35:50,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:35:50,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,839 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-18 08:35:50,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,843 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-18 08:35:50,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:50,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:50,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:50,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,849 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-18 08:35:50,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,850 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:35:50,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,852 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:35:50,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:50,860 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-18 08:35:50,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:50,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:50,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:50,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:50,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:50,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:50,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:50,886 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:35:50,886 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:35:50,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:50,890 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:35:50,890 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:50,890 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-18 08:35:50,952 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 08:35:50,959 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:35:50,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:51,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:51,056 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-18 08:35:51,059 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-18 08:35:51,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-18 08:35:51,101 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 48 states and 56 transitions. Complement of second has 4 states. [2018-11-18 08:35:51,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 08:35:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-18 08:35:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-18 08:35:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-18 08:35:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-18 08:35:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:51,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-11-18 08:35:51,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:35:51,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 24 states and 29 transitions. [2018-11-18 08:35:51,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 08:35:51,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 08:35:51,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2018-11-18 08:35:51,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:51,107 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 08:35:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2018-11-18 08:35:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 08:35:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 08:35:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-18 08:35:51,110 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 08:35:51,110 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-18 08:35:51,110 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:35:51,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2018-11-18 08:35:51,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:35:51,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:51,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:51,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:51,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:51,113 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 324#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 325#L14 assume !(build_nondet_String_~length~0 < 1); 327#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 318#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 319#L14-3 assume !(build_nondet_String_~length~0 < 1); 320#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 315#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 306#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 308#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 311#L33-6 [2018-11-18 08:35:51,113 INFO L796 eck$LassoCheckResult]: Loop: 311#L33-6 assume true; 312#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 321#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 316#L33-4 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 311#L33-6 [2018-11-18 08:35:51,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-18 08:35:51,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 1 times [2018-11-18 08:35:51,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash 111434683, now seen corresponding path program 1 times [2018-11-18 08:35:51,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:51,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:51,506 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 117 [2018-11-18 08:35:51,577 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:35:51,577 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:35:51,577 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:35:51,577 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:35:51,577 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:35:51,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:35:51,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:35:51,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:35:51,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-18 08:35:51,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:35:51,578 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:35:51,582 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-18 08:35:51,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-18 08:35:51,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:51,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-18 08:35:51,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-18 08:35:51,592 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-18 08:35:51,593 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-18 08:35:51,593 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-18 08:35:51,594 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-18 08:35:51,596 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-18 08:35:51,597 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-18 08:35:51,598 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-18 08:35:51,599 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-18 08:35:51,600 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-18 08:35:51,600 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-18 08:35:51,601 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-18 08:35:51,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:35:52,105 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-11-18 08:35:52,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:35:52,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:35:52,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,135 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-18 08:35:52,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,142 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-18 08:35:52,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,149 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-18 08:35:52,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,151 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-18 08:35:52,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:35:52,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,154 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-18 08:35:52,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,156 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-18 08:35:52,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:35:52,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:35:52,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:35:52,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,158 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-18 08:35:52,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:35:52,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:35:52,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,168 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-18 08:35:52,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,171 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-18 08:35:52,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,174 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-18 08:35:52,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:35:52,177 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-18 08:35:52,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:35:52,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:35:52,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:35:52,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:35:52,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:35:52,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:35:52,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:35:52,202 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:35:52,202 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 08:35:52,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:35:52,203 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:35:52,203 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:35:52,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-18 08:35:52,240 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 08:35:52,241 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:35:52,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:52,298 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-18 08:35:52,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 08:35:52,299 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 08:35:52,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 29 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 9 states. [2018-11-18 08:35:52,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:35:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:35:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-18 08:35:52,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-18 08:35:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:52,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-18 08:35:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:52,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 08:35:52,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:35:52,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-18 08:35:52,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:35:52,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2018-11-18 08:35:52,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 08:35:52,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-18 08:35:52,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-18 08:35:52,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:35:52,358 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 08:35:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-18 08:35:52,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-11-18 08:35:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 08:35:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-18 08:35:52,362 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 08:35:52,362 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-18 08:35:52,362 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:35:52,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-18 08:35:52,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:35:52,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:35:52,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:35:52,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:35:52,365 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:35:52,365 INFO L794 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 521#L14 assume !(build_nondet_String_~length~0 < 1); 524#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 514#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 515#L14-3 assume !(build_nondet_String_~length~0 < 1); 516#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 510#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 499#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 500#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 507#L33-6 assume true; 509#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 518#L33-2 assume !cstrcspn_#t~short7; 519#L33-4 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 497#L33-7 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 498#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 504#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 501#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 503#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 505#L33-6 [2018-11-18 08:35:52,365 INFO L796 eck$LassoCheckResult]: Loop: 505#L33-6 assume true; 506#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 517#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 511#L33-4 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 505#L33-6 [2018-11-18 08:35:52,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1899230978, now seen corresponding path program 1 times [2018-11-18 08:35:52,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 2 times [2018-11-18 08:35:52,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:35:52,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:35:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash 948711020, now seen corresponding path program 1 times [2018-11-18 08:35:52,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:35:52,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:35:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:35:52,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:35:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:35:52,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:35:52,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8433c2c5-f4dd-4157-8929-5c0b7c685f11/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-18 08:35:52,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:35:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:35:52,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:35:52,509 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-18 08:35:52,511 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-18 08:35:52,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:35:52,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:35:52,516 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-18 08:35:52,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-18 08:36:29,375 WARN L180 SmtUtils]: Spent 761.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 08:36:54,507 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 08:37:09,146 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-18 08:37:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:37:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:37:09,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-18 08:37:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 08:37:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=140, Unknown=7, NotChecked=0, Total=182 [2018-11-18 08:37:09,318 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 14 states. [2018-11-18 08:37:11,604 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-18 08:37:13,913 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-18 08:37:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:37:13,959 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-18 08:37:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 08:37:13,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 77 transitions. [2018-11-18 08:37:13,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:37:13,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 53 states and 62 transitions. [2018-11-18 08:37:13,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 08:37:13,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 08:37:13,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2018-11-18 08:37:13,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:37:13,962 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2018-11-18 08:37:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2018-11-18 08:37:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-11-18 08:37:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 08:37:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-18 08:37:13,964 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 08:37:13,964 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 08:37:13,964 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 08:37:13,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2018-11-18 08:37:13,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:37:13,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:37:13,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:37:13,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 08:37:13,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:37:13,967 INFO L794 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 718#L14 assume !(build_nondet_String_~length~0 < 1); 721#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 711#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 712#L14-3 assume !(build_nondet_String_~length~0 < 1); 713#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.alloc(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 706#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, 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; 696#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 697#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 724#L33-6 assume true; 719#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 715#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 716#L33-4 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5; 694#L33-7 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 695#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 705#L30-3 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, 1 + cstrcspn_#t~post2.offset;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 698#L30-4 assume true;call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 700#L30-1 assume !!(0 != cstrcspn_#t~mem3);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 701#L33-6 [2018-11-18 08:37:13,967 INFO L796 eck$LassoCheckResult]: Loop: 701#L33-6 assume true; 702#L33-1 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 714#L33-2 assume cstrcspn_#t~short7;call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 707#L33-4 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, 1 + cstrcspn_#t~post8.offset;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 701#L33-6 [2018-11-18 08:37:13,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:13,967 INFO L82 PathProgramCache]: Analyzing trace with hash 124223616, now seen corresponding path program 2 times [2018-11-18 08:37:13,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:13,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:13,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:37:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:13,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:13,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1941483, now seen corresponding path program 3 times [2018-11-18 08:37:13,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:13,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:13,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:13,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:13,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:14,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 247646442, now seen corresponding path program 1 times [2018-11-18 08:37:14,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:37:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:37:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:14,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:37:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:37:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:37:14,244 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-18 08:37:14,650 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 156 [2018-11-18 08:37:15,263 WARN L180 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 114 [2018-11-18 08:37:15,264 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:37:15,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:37:15,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:37:15,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:37:15,265 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:37:15,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:37:15,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:37:15,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:37:15,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-18 08:37:15,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:37:15,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:37:15,271 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-18 08:37:15,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:15,282 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-18 08:37:15,283 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-18 08:37:15,284 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-18 08:37:15,285 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-18 08:37:15,286 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-18 08:37:15,287 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-18 08:37:15,289 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-18 08:37:15,290 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-18 08:37:15,291 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-18 08:37:15,292 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-18 08:37:15,293 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-18 08:37:15,293 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-18 08:37:15,398 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 08:37:15,841 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2018-11-18 08:37:15,914 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-18 08:37:15,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:15,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:37:16,568 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-18 08:37:16,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:37:16,671 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:37:16,671 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-18 08:37:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,673 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-18 08:37:16,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:16,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:16,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,675 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-18 08:37:16,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,677 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-18 08:37:16,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,678 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-18 08:37:16,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,680 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-18 08:37:16,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,681 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-18 08:37:16,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,683 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-18 08:37:16,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:16,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:16,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,685 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-18 08:37:16,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,687 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-18 08:37:16,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,688 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-18 08:37:16,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,690 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-18 08:37:16,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,691 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-18 08:37:16,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:37:16,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:37:16,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:37:16,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,693 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-18 08:37:16,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,693 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 08:37:16,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 08:37:16,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:16,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,698 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-18 08:37:16,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:16,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:16,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:37:16,701 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-18 08:37:16,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:37:16,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:37:16,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:37:16,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:37:16,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:37:16,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:37:16,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:37:16,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 08:37:16,742 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 08:37:16,742 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:37:16,743 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:37:16,743 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:37:16,743 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_build_nondet_String_#t~malloc1.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-18 08:37:16,828 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2018-11-18 08:37:16,831 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 08:37:16,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:16,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:16,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:16,898 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-18 08:37:16,898 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 08:37:16,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 08:37:16,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 58 states and 69 transitions. Complement of second has 9 states. [2018-11-18 08:37:16,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:37:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:37:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-18 08:37:16,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 08:37:16,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:16,939 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:37:16,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:16,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:17,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:17,011 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-18 08:37:17,011 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 08:37:17,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 08:37:17,046 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 58 states and 69 transitions. Complement of second has 9 states. [2018-11-18 08:37:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:37:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:37:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-18 08:37:17,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 08:37:17,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:17,047 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 08:37:17,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:37:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:17,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:37:17,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:37:17,106 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-18 08:37:17,106 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 08:37:17,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10 Second operand 6 states. [2018-11-18 08:37:17,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 60 states and 74 transitions. Complement of second has 8 states. [2018-11-18 08:37:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:37:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 08:37:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-18 08:37:17,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 08:37:17,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:17,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-18 08:37:17,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:17,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-18 08:37:17,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:37:17,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 74 transitions. [2018-11-18 08:37:17,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:37:17,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2018-11-18 08:37:17,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:37:17,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:37:17,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:37:17,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:37:17,156 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:37:17,156 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:37:17,156 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:37:17,156 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 08:37:17,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:37:17,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:37:17,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:37:17,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:37:17 BoogieIcfgContainer [2018-11-18 08:37:17,161 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:37:17,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:37:17,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:37:17,162 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:37:17,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:48" (3/4) ... [2018-11-18 08:37:17,164 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:37:17,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:37:17,165 INFO L168 Benchmark]: Toolchain (without parser) took 89083.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -93.0 MB). Peak memory consumption was 102.5 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,165 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:37:17,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.04 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,166 INFO L168 Benchmark]: Boogie Preprocessor took 58.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,166 INFO L168 Benchmark]: RCFGBuilder took 207.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,167 INFO L168 Benchmark]: BuchiAutomizer took 88609.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.2 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. [2018-11-18 08:37:17,167 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:37:17,170 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.04 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.12 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -191.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 207.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 88609.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.2 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[build_nondet_String()] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 88.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 83.0s. Construction of modules took 0.2s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 139 SDtfs, 226 SDslu, 197 SDs, 0 SdLazy, 281 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital377 mio100 ax100 hnf99 lsp91 ukn70 mio100 lsp27 div151 bol100 ite100 ukn100 eq154 hnf72 smp91 dnf1153 smp24 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...