./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/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_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/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-0cd3be1 [2018-11-28 12:51:21,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:51:21,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:51:21,083 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:51:21,083 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:51:21,084 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:51:21,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:51:21,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:51:21,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:51:21,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:51:21,088 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:51:21,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:51:21,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:51:21,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:51:21,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:51:21,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:51:21,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:51:21,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:51:21,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:51:21,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:51:21,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:51:21,095 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:51:21,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:51:21,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:51:21,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:51:21,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:51:21,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:51:21,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:51:21,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:51:21,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:51:21,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:51:21,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:51:21,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:51:21,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:51:21,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:51:21,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:51:21,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:51:21,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:51:21,110 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:51:21,110 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:51:21,111 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:51:21,111 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:51:21,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:51:21,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:51:21,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:51:21,113 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:51:21,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:51:21,114 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:51:21,114 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:51:21,114 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:51:21,115 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_7f5c45fd-c503-42b9-9d75-83757483baa7/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-28 12:51:21,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:51:21,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:51:21,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:51:21,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:51:21,150 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:51:21,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-28 12:51:21,192 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/data/44792783a/b751e02fe6ac4f07a113d07449111c17/FLAGf68f5e6ca [2018-11-28 12:51:21,540 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:51:21,541 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/sv-benchmarks/c/termination-crafted-lit/cstrcspn_true-termination_true-no-overflow.c [2018-11-28 12:51:21,545 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/data/44792783a/b751e02fe6ac4f07a113d07449111c17/FLAGf68f5e6ca [2018-11-28 12:51:21,960 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/bin-2019/uautomizer/data/44792783a/b751e02fe6ac4f07a113d07449111c17 [2018-11-28 12:51:21,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:51:21,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:51:21,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:51:21,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:51:21,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:51:21,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:51:21" (1/1) ... [2018-11-28 12:51:21,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aaa4c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:21, skipping insertion in model container [2018-11-28 12:51:21,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:51:21" (1/1) ... [2018-11-28 12:51:21,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:51:21,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:51:22,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:51:22,111 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:51:22,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:51:22,132 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:51:22,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22 WrapperNode [2018-11-28 12:51:22,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:51:22,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:51:22,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:51:22,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:51:22,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:51:22,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:51:22,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:51:22,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:51:22,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... [2018-11-28 12:51:22,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:51:22,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:51:22,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:51:22,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:51:22,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/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-28 12:51:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:51:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:51:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:51:22,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:51:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:51:22,405 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:51:22,405 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-28 12:51:22,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:51:22 BoogieIcfgContainer [2018-11-28 12:51:22,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:51:22,406 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:51:22,406 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:51:22,409 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:51:22,410 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:51:22,410 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:51:21" (1/3) ... [2018-11-28 12:51:22,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@189d34da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:51:22, skipping insertion in model container [2018-11-28 12:51:22,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:51:22,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:51:22" (2/3) ... [2018-11-28 12:51:22,411 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@189d34da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:51:22, skipping insertion in model container [2018-11-28 12:51:22,411 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:51:22,411 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:51:22" (3/3) ... [2018-11-28 12:51:22,413 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_true-termination_true-no-overflow.c [2018-11-28 12:51:22,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:51:22,455 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:51:22,455 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:51:22,455 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:51:22,455 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:51:22,456 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:51:22,456 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:51:22,456 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:51:22,456 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:51:22,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 12:51:22,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:51:22,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:22,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:22,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,492 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:51:22,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-28 12:51:22,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:51:22,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:22,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:22,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,499 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#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; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 17#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;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-28 12:51:22,500 INFO L796 eck$LassoCheckResult]: Loop: 3#L30-4true 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; 7#L33-5true assume !true; 4#L33-6true call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 20#L35true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 5#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-28 12:51:22,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:22,504 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2018-11-28 12:51:22,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:22,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:22,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2018-11-28 12:51:22,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:22,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:22,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:22,631 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-28 12:51:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:51:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:51:22,635 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:51:22,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:51:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:51:22,646 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-28 12:51:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:51:22,651 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-28 12:51:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:51:22,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-28 12:51:22,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:51:22,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2018-11-28 12:51:22,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:51:22,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 12:51:22,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 12:51:22,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:51:22,657 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 12:51:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 12:51:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 12:51:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 12:51:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 12:51:22,674 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 12:51:22,674 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 12:51:22,674 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:51:22,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 12:51:22,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 12:51:22,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:22,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:22,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:22,675 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#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; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 61#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; 57#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 50#L30-4 [2018-11-28 12:51:22,676 INFO L796 eck$LassoCheckResult]: Loop: 50#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 51#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; 55#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 56#L33-1 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-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 52#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 53#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 54#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; 50#L30-4 [2018-11-28 12:51:22,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2018-11-28 12:51:22,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2018-11-28 12:51:22,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:51:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:22,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2018-11-28 12:51:22,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:22,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:22,916 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-28 12:51:22,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:51:22,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:51:23,092 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 12:51:23,237 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-28 12:51:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:51:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:51:23,238 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 12:51:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:51:23,365 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-28 12:51:23,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:51:23,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-28 12:51:23,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:51:23,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-28 12:51:23,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 12:51:23,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 12:51:23,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-28 12:51:23,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:51:23,368 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-28 12:51:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-28 12:51:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-28 12:51:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:51:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-28 12:51:23,370 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 12:51:23,370 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-28 12:51:23,370 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:51:23,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-28 12:51:23,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-28 12:51:23,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:23,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:23,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:23,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:23,372 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 132#L14 assume !(build_nondet_String_~length~0 < 1); 137#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; 127#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 128#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; 142#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 141#L30-4 [2018-11-28 12:51:23,372 INFO L796 eck$LassoCheckResult]: Loop: 141#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 140#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; 123#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 124#L33-1 assume !cstrcspn_#t~short7; 129#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 120#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 121#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 138#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; 141#L30-4 [2018-11-28 12:51:23,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2018-11-28 12:51:23,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:23,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:23,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:23,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1951138125, now seen corresponding path program 1 times [2018-11-28 12:51:23,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:23,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:23,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:23,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash -252975234, now seen corresponding path program 1 times [2018-11-28 12:51:23,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:23,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:23,741 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 104 [2018-11-28 12:51:23,810 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:51:23,811 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:51:23,811 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:51:23,811 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:51:23,811 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:51:23,811 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:51:23,811 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:51:23,811 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:51:23,811 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration3_Lasso [2018-11-28 12:51:23,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:51:23,812 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:51:23,824 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-28 12:51:23,827 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-28 12:51:23,828 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-28 12:51:23,830 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-28 12:51:23,831 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-28 12:51:23,836 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-28 12:51:23,838 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-28 12:51:23,839 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-28 12:51:23,840 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-28 12:51:23,841 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-28 12:51:23,842 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-28 12:51:23,843 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-28 12:51:23,845 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-28 12:51:23,846 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-28 12:51:23,848 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-28 12:51:24,066 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-28 12:51:24,067 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-28 12:51:24,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:51:24,357 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:51:24,359 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-28 12:51:24,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,365 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-28 12:51:24,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,367 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-28 12:51:24,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:24,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:24,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:24,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:24,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:24,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:24,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:24,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:24,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,388 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-28 12:51:24,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:24,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,393 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-28 12:51:24,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,395 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-28 12:51:24,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,397 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-28 12:51:24,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,399 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-28 12:51:24,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,401 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-28 12:51:24,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:24,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:24,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:24,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:24,403 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-28 12:51:24,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:24,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:24,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:24,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:24,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:24,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:24,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:51:24,443 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:51:24,443 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:51:24,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:51:24,446 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:51:24,446 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:51:24,446 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 Supporting invariants [] [2018-11-28 12:51:24,484 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 12:51:24,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:51:24,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:24,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:51:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:24,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:51:24,537 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-28 12:51:24,540 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-28 12:51:24,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 12:51:24,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 44 states and 52 transitions. Complement of second has 4 states. [2018-11-28 12:51:24,581 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-28 12:51:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 12:51:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-28 12:51:24,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-28 12:51:24,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:24,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-28 12:51:24,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:24,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2018-11-28 12:51:24,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:24,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-28 12:51:24,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:51:24,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 22 states and 27 transitions. [2018-11-28 12:51:24,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 12:51:24,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:51:24,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 12:51:24,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:51:24,587 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 12:51:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 12:51:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 12:51:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 12:51:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 12:51:24,589 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 12:51:24,589 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 12:51:24,589 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:51:24,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 12:51:24,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:51:24,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:24,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:24,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:24,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:51:24,590 INFO L794 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 308#L14 assume !(build_nondet_String_~length~0 < 1); 311#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; 302#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 303#L14-3 assume !(build_nondet_String_~length~0 < 1); 306#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; 301#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 290#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 292#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; 297#L33-5 [2018-11-28 12:51:24,590 INFO L796 eck$LassoCheckResult]: Loop: 297#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 298#L33-1 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); 304#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 297#L33-5 [2018-11-28 12:51:24,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2018-11-28 12:51:24,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2018-11-28 12:51:24,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:24,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:24,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:24,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2018-11-28 12:51:24,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:24,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:24,972 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-11-28 12:51:25,043 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:51:25,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:51:25,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:51:25,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:51:25,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:51:25,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:51:25,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:51:25,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:51:25,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-28 12:51:25,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:51:25,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:51:25,047 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-28 12:51:25,049 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-28 12:51:25,051 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-28 12:51:25,052 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-28 12:51:25,054 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-28 12:51:25,055 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-28 12:51:25,056 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-28 12:51:25,058 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-28 12:51:25,059 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-28 12:51:25,060 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-28 12:51:25,061 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-28 12:51:25,063 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-28 12:51:25,064 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-28 12:51:25,065 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-28 12:51:25,067 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-28 12:51:25,068 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-28 12:51:25,069 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-28 12:51:25,588 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:51:25,588 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:51:25,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:25,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,590 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-28 12:51:25,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,591 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-28 12:51:25,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,593 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-28 12:51:25,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,596 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-28 12:51:25,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,598 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-28 12:51:25,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,600 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-28 12:51:25,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,601 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-28 12:51:25,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,603 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-28 12:51:25,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:51:25,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,607 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-28 12:51:25,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,610 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-28 12:51:25,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,612 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-28 12:51:25,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,614 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-28 12:51:25,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,616 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-28 12:51:25,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,618 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-28 12:51:25,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:51:25,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:51:25,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:51:25,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,619 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-28 12:51:25,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,620 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:51:25,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:51:25,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,631 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-28 12:51:25,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,634 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-28 12:51:25,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,637 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-28 12:51:25,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:51:25,641 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-28 12:51:25,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:51:25,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:51:25,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:51:25,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:51:25,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:51:25,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:51:25,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:51:25,667 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:51:25,667 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 12:51:25,667 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:51:25,668 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:51:25,669 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:51:25,669 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-28 12:51:25,703 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 12:51:25,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:51:25,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:25,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:51:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:25,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:51:25,790 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-28 12:51:25,790 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-28 12:51:25,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-28 12:51:25,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 49 states and 59 transitions. Complement of second has 7 states. [2018-11-28 12:51:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:51:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:51:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 12:51:25,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 12:51:25,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:25,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 12:51:25,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:25,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 12:51:25,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:51:25,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 59 transitions. [2018-11-28 12:51:25,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:51:25,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 42 transitions. [2018-11-28 12:51:25,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 12:51:25,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 12:51:25,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-28 12:51:25,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:51:25,856 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-28 12:51:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-28 12:51:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-28 12:51:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:51:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-11-28 12:51:25,860 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 12:51:25,860 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-11-28 12:51:25,861 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:51:25,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-11-28 12:51:25,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:51:25,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:51:25,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:51:25,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:51:25,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:51:25,862 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 489#L14 assume !(build_nondet_String_~length~0 < 1); 493#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; 483#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 484#L14-3 assume !(build_nondet_String_~length~0 < 1); 487#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; 481#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 469#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 470#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; 482#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 490#L33-1 assume !cstrcspn_#t~short7; 491#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 475#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 476#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 474#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; 471#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 473#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; 477#L33-5 [2018-11-28 12:51:25,863 INFO L796 eck$LassoCheckResult]: Loop: 477#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 478#L33-1 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); 485#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 477#L33-5 [2018-11-28 12:51:25,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 2 times [2018-11-28 12:51:25,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:25,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:25,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2018-11-28 12:51:25,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:51:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:51:25,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:51:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash -238092697, now seen corresponding path program 1 times [2018-11-28 12:51:25,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:51:25,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:51:25,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:51:25,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:51:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:51:25,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:51:25,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7f5c45fd-c503-42b9-9d75-83757483baa7/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-28 12:51:25,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:51:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:51:26,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:51:26,047 INFO L478 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-28 12:51:26,049 INFO L478 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-28 12:51:26,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:51:26,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:51:26,060 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-28 12:51:26,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-28 12:52:03,702 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 12:52:30,069 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 12:52:44,867 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 12:52:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:44,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:52:44,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-11-28 12:52:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:52:44,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=140, Unknown=7, NotChecked=0, Total=182 [2018-11-28 12:52:44,982 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 14 states. [2018-11-28 12:52:47,743 WARN L180 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-28 12:52:50,000 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-28 12:52:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:50,044 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-28 12:52:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:52:50,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 67 transitions. [2018-11-28 12:52:50,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:52:50,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 45 states and 54 transitions. [2018-11-28 12:52:50,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 12:52:50,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:52:50,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2018-11-28 12:52:50,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:50,046 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 12:52:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2018-11-28 12:52:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-28 12:52:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 12:52:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-28 12:52:50,048 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-28 12:52:50,048 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-28 12:52:50,048 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:52:50,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-28 12:52:50,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 12:52:50,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:50,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:50,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:50,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:52:50,051 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 666#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12;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; 667#L14 assume !(build_nondet_String_~length~0 < 1); 671#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; 660#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 661#L14-3 assume !(build_nondet_String_~length~0 < 1); 665#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; 658#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;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; 646#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 647#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; 675#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 668#L33-1 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); 669#L33-3 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7; 651#L33-6 call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 652#L35 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 653#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; 648#L30-4 call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 650#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; 654#L33-5 [2018-11-28 12:52:50,051 INFO L796 eck$LassoCheckResult]: Loop: 654#L33-5 call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short7 := 0 != cstrcspn_#t~mem5; 655#L33-1 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); 662#L33-3 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~short7;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; 654#L33-5 [2018-11-28 12:52:50,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 1 times [2018-11-28 12:52:50,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:50,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:50,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2018-11-28 12:52:50,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:50,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:50,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2018-11-28 12:52:50,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:50,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:50,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:50,781 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 154 [2018-11-28 12:52:51,312 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-28 12:52:51,313 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:51,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:51,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:51,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:51,314 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:51,314 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:51,314 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:51,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:51,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_true-termination_true-no-overflow.c_Iteration6_Lasso [2018-11-28 12:52:51,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:51,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:51,321 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-28 12:52:51,327 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-28 12:52:51,330 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-28 12:52:51,332 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-28 12:52:51,333 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-28 12:52:51,335 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-28 12:52:51,336 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-28 12:52:51,425 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 12:52:51,798 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-11-28 12:52:51,863 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-28 12:52:51,864 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-28 12:52:51,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:51,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:51,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:51,870 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-28 12:52:51,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:51,872 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-28 12:52:51,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:51,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:52,498 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-28 12:52:52,646 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:52,646 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:52,647 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-28 12:52:52,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:52,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:52,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:52,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,648 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-28 12:52:52,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,658 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-28 12:52:52,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:52,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:52,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:52,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,659 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-28 12:52:52,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:52,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:52,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:52,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,661 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-28 12:52:52,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:52,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:52,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:52,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:52,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:52,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:52,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:52,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,664 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-28 12:52:52,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,667 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-28 12:52:52,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,667 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:52:52,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,668 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:52:52,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,672 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-28 12:52:52,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,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-28 12:52:52,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,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-28 12:52:52,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:52:52,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,679 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:52:52,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,686 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-28 12:52:52,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,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-28 12:52:52,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,689 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-11-28 12:52:52,689 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-28 12:52:52,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,710 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-11-28 12:52:52,710 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-28 12:52:52,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,800 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-28 12:52:52,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:52,805 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-28 12:52:52,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:52,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:52,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:52,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:52,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:52:52,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:52:52,817 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:52,826 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 12:52:52,827 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:52:52,827 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:52,827 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:52:52,828 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:52,828 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-28 12:52:52,875 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-28 12:52:52,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 12:52:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:52,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:52,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:52,940 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-28 12:52:52,941 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-28 12:52:52,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 12:52:52,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-11-28 12:52:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:52:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 12:52:52,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 12:52:52,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:52,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:52:52,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:53,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:53,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:53,039 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-28 12:52:53,039 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-28 12:52:53,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 12:52:53,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2018-11-28 12:52:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:52:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 12:52:53,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 12:52:53,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:53,082 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:52:53,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:53,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:53,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:53,190 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-28 12:52:53,190 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-28 12:52:53,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 12:52:53,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 6 states. [2018-11-28 12:52:53,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:52:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-28 12:52:53,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-28 12:52:53,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:53,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 12:52:53,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:53,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-28 12:52:53,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:53,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2018-11-28 12:52:53,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:52:53,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2018-11-28 12:52:53,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:52:53,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:52:53,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:52:53,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:52:53,240 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:52:53,240 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:52:53,240 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:52:53,240 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:52:53,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:52:53,241 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:52:53,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:52:53,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:52:53 BoogieIcfgContainer [2018-11-28 12:52:53,246 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:52:53,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:52:53,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:52:53,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:52:53,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:51:22" (3/4) ... [2018-11-28 12:52:53,250 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:52:53,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:52:53,251 INFO L168 Benchmark]: Toolchain (without parser) took 91288.22 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -234.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:52:53,251 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:52:53,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:53,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:53,253 INFO L168 Benchmark]: Boogie Preprocessor took 60.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -202.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:53,253 INFO L168 Benchmark]: RCFGBuilder took 183.19 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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:53,254 INFO L168 Benchmark]: BuchiAutomizer took 90839.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.3 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:53,254 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:52:53,257 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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 29.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -202.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.19 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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 90839.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.3 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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 -1 * sc1 + unknown-#length-unknown[build_nondet_String()] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 90.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 84.8s. Construction of modules took 0.2s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 128 SDtfs, 187 SDslu, 188 SDs, 0 SdLazy, 297 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital338 mio100 ax100 hnf99 lsp91 ukn73 mio100 lsp30 div129 bol100 ite100 ukn100 eq166 hnf80 smp91 dnf844 smp50 tf100 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 111ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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...