./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcd11173df80f9a00fde2714abfd2a4ff8d40757 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:29:21,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:29:21,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:29:21,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:29:21,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:29:21,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:29:21,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:29:21,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:29:21,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:29:21,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:29:21,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:29:21,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:29:21,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:29:21,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:29:21,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:29:21,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:29:21,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:29:21,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:29:21,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:29:21,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:29:21,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:29:21,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:29:21,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:29:21,207 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:29:21,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:29:21,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:29:21,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:29:21,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:29:21,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:29:21,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:29:21,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:29:21,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:29:21,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:29:21,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:29:21,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:29:21,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:29:21,213 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 14:29:21,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:29:21,224 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:29:21,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:29:21,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:29:21,225 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:29:21,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:29:21,226 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:29:21,226 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:29:21,226 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:29:21,226 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:29:21,226 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:29:21,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:29:21,227 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:29:21,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:29:21,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:29:21,228 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:29:21,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:29:21,229 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_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcd11173df80f9a00fde2714abfd2a4ff8d40757 [2018-11-18 14:29:21,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:29:21,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:29:21,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:29:21,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:29:21,261 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:29:21,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-18 14:29:21,299 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/data/7f97db761/fa0645bfa0974107a7659595f77a8c5d/FLAG2664c8b8a [2018-11-18 14:29:21,732 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:29:21,732 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-18 14:29:21,738 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/data/7f97db761/fa0645bfa0974107a7659595f77a8c5d/FLAG2664c8b8a [2018-11-18 14:29:21,748 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/data/7f97db761/fa0645bfa0974107a7659595f77a8c5d [2018-11-18 14:29:21,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:29:21,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:29:21,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:29:21,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:29:21,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:29:21,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:29:21" (1/1) ... [2018-11-18 14:29:21,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44021729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:21, skipping insertion in model container [2018-11-18 14:29:21,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:29:21" (1/1) ... [2018-11-18 14:29:21,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:29:21,787 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:29:21,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:29:21,992 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:29:22,062 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:29:22,096 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:29:22,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22 WrapperNode [2018-11-18 14:29:22,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:29:22,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:29:22,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:29:22,097 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:29:22,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:29:22,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:29:22,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:29:22,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:29:22,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... [2018-11-18 14:29:22,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:29:22,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:29:22,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:29:22,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:29:22,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 14:29:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 14:29:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 14:29:22,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 14:29:22,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:29:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:29:22,338 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:29:22,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:22 BoogieIcfgContainer [2018-11-18 14:29:22,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:29:22,339 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:29:22,339 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:29:22,341 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:29:22,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:22,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:29:21" (1/3) ... [2018-11-18 14:29:22,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4206a189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:29:22, skipping insertion in model container [2018-11-18 14:29:22,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:22,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:29:22" (2/3) ... [2018-11-18 14:29:22,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4206a189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:29:22, skipping insertion in model container [2018-11-18 14:29:22,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:29:22,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:22" (3/3) ... [2018-11-18 14:29:22,344 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_diffterm_alloca_true-termination.c.i [2018-11-18 14:29:22,381 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:29:22,381 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:29:22,381 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:29:22,381 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:29:22,381 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:29:22,382 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:29:22,382 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:29:22,382 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:29:22,382 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:29:22,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 14:29:22,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 14:29:22,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:22,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:22,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:29:22,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 14:29:22,413 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:29:22,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 14:29:22,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 14:29:22,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:22,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:22,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:29:22,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 14:29:22,420 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 17#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 6#L369-4true [2018-11-18 14:29:22,420 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 19#L369-1true assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 4#L372-6true assume !true; 7#L372-7true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 9#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2018-11-18 14:29:22,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 14:29:22,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:22,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 14:29:22,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:22,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:29:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 14:29:22,551 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:29:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 14:29:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 14:29:22,563 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 14:29:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:22,567 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 14:29:22,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 14:29:22,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 14:29:22,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 14:29:22,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 14:29:22,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:29:22,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 14:29:22,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 14:29:22,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:22,575 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 14:29:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 14:29:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 14:29:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 14:29:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 14:29:22,596 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 14:29:22,596 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 14:29:22,596 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:29:22,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 14:29:22,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 14:29:22,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:22,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:22,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:29:22,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:29:22,598 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 54#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 55#L382 assume !(main_~length1~0 < 1); 56#L382-2 assume !(main_~length2~0 < 1); 53#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 49#L369-4 [2018-11-18 14:29:22,598 INFO L796 eck$LassoCheckResult]: Loop: 49#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 50#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 46#L372-6 assume true; 47#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 57#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 59#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 51#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 52#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 48#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 49#L369-4 [2018-11-18 14:29:22,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 14:29:22,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 14:29:22,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 14:29:22,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:22,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:22,847 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 14:29:23,000 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-11-18 14:29:23,194 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-18 14:29:23,265 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:29:23,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:29:23,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:29:23,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:29:23,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:29:23,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:23,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:29:23,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:29:23,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-18 14:29:23,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:29:23,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:29:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:23,961 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-11-18 14:29:24,057 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:29:24,062 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:29:24,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:24,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:24,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:24,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:24,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:24,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:24,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:24,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:24,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:24,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:24,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:24,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:24,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:24,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:24,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:24,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:24,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:24,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:24,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:24,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:24,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:24,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:24,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:24,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:24,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:29:24,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:29:24,130 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 14:29:24,132 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:29:24,133 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:29:24,134 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:29:24,134 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-18 14:29:24,172 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 14:29:24,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:29:24,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:24,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:24,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:24,247 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 14:29:24,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 14:29:24,293 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 14:29:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 14:29:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:29:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 14:29:24,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 14:29:24,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:24,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 14:29:24,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:24,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 14:29:24,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:24,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 14:29:24,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:24,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 14:29:24,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 14:29:24,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 14:29:24,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 14:29:24,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:29:24,301 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 14:29:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 14:29:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 14:29:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 14:29:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 14:29:24,302 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 14:29:24,302 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 14:29:24,302 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:29:24,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 14:29:24,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:24,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:24,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:24,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:29:24,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 14:29:24,303 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 199#L382 assume !(main_~length1~0 < 1); 200#L382-2 assume !(main_~length2~0 < 1); 197#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 192#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 194#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 186#L372-6 [2018-11-18 14:29:24,304 INFO L796 eck$LassoCheckResult]: Loop: 186#L372-6 assume true; 187#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 201#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 204#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 186#L372-6 [2018-11-18 14:29:24,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 14:29:24,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 14:29:24,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:24,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:24,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 14:29:24,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:24,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:24,702 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2018-11-18 14:29:24,786 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:29:24,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:29:24,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:29:24,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:29:24,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:29:24,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:24,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:29:24,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:29:24,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 14:29:24,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:29:24,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:29:24,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:24,985 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-18 14:29:25,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:25,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:25,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29: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-18 14:29:25,478 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-18 14:29:25,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:29:25,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:29:25,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:25,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:25,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:25,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,535 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:29:25,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,542 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:29:25,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,550 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:29:25,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,554 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:29:25,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:25,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:25,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:25,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:25,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:25,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:25,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:25,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:25,584 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:29:25,600 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 14:29:25,600 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 14:29:25,601 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:29:25,602 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:29:25,602 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:29:25,602 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-18 14:29:25,645 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-18 14:29:25,647 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:29:25,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:25,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:25,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:25,691 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 14:29:25,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 14:29:25,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 14:29:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:29:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:29:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 14:29:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 14:29:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:25,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 14:29:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:25,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 14:29:25,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:25,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 14:29:25,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:25,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 14:29:25,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 14:29:25,730 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 14:29:25,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 14:29:25,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:29:25,730 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 14:29:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 14:29:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 14:29:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 14:29:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 14:29:25,732 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 14:29:25,732 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 14:29:25,732 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:29:25,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 14:29:25,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:25,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:25,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:25,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:29:25,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 14:29:25,734 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 393#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 394#L382 assume !(main_~length1~0 < 1); 395#L382-2 assume !(main_~length2~0 < 1); 392#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 386#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 387#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 402#L372-6 assume true; 405#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 404#L372-2 assume !cstrcspn_#t~short210; 403#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 390#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 391#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 384#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 385#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 389#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 380#L372-6 [2018-11-18 14:29:25,734 INFO L796 eck$LassoCheckResult]: Loop: 380#L372-6 assume true; 381#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 396#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 400#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 380#L372-6 [2018-11-18 14:29:25,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 14:29:25,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:25,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:25,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:25,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 14:29:25,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:25,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:25,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:25,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:25,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:25,760 INFO L82 PathProgramCache]: Analyzing trace with hash -94928371, now seen corresponding path program 1 times [2018-11-18 14:29:25,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:25,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:25,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:29:25,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03126ad5-4db5-4c69-860b-23299678b012/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:29:25,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:25,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:25,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-18 14:29:25,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-18 14:29:25,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 14:29:25,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-18 14:29:25,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-18 14:29:25,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 14:29:25,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:29:25,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 14:29:25,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-18 14:29:25,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-18 14:29:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:38,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:29:38,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-18 14:29:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:29:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2018-11-18 14:29:38,167 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-18 14:29:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:29:50,287 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2018-11-18 14:29:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:29:50,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 82 transitions. [2018-11-18 14:29:50,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:50,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 51 states and 61 transitions. [2018-11-18 14:29:50,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 14:29:50,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 14:29:50,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 61 transitions. [2018-11-18 14:29:50,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:29:50,290 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 61 transitions. [2018-11-18 14:29:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 61 transitions. [2018-11-18 14:29:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-18 14:29:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 14:29:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-18 14:29:50,293 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 14:29:50,293 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-18 14:29:50,293 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:29:50,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-18 14:29:50,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 14:29:50,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:29:50,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:29:50,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:29:50,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 14:29:50,294 INFO L794 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 570#L382 assume !(main_~length1~0 < 1); 571#L382-2 assume !(main_~length2~0 < 1); 568#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 562#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 563#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 583#L372-6 assume true; 584#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 576#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 577#L372-4 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210; 566#L372-7 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 567#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 560#L369-3 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 561#L369-4 assume true;call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 565#L369-1 assume !!(49 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 556#L372-6 [2018-11-18 14:29:50,294 INFO L796 eck$LassoCheckResult]: Loop: 556#L372-6 assume true; 557#L372-1 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 49 != cstrcspn_#t~mem208; 572#L372-2 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 575#L372-4 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 556#L372-6 [2018-11-18 14:29:50,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 14:29:50,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:50,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:29:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 14:29:50,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:50,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 14:29:50,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:29:50,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:29:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:29:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:29:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:29:50,796 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 133 [2018-11-18 14:29:51,523 WARN L180 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 110 [2018-11-18 14:29:51,525 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:29:51,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:29:51,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:29:51,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:29:51,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:29:51,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:29:51,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:29:51,525 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:29:51,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_diffterm_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 14:29:51,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:29:51,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:29:51,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:51,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 14:29:52,101 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-18 14:29:52,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 14:29:52,919 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-18 14:29:53,024 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-18 14:29:53,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:29:53,096 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:29:53,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:29:53,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:29:53,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:29:53,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,135 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:29:53,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,136 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:29:53,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,148 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-18 14:29:53,148 INFO L206 nArgumentSynthesizer]: 7 loop disjuncts [2018-11-18 14:29:53,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,182 INFO L402 nArgumentSynthesizer]: We have 280 Motzkin's Theorem applications. [2018-11-18 14:29:53,182 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2018-11-18 14:29:53,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 14:29:53,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,331 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 14:29:53,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:29:53,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 14:29:53,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:29:53,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:29:53,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:29:53,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:29:53,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:29:53,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:29:53,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:29:53,354 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:29:53,354 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 14:29:53,354 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:29:53,355 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 14:29:53,355 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:29:53,355 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-11-18 14:29:53,453 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-18 14:29:53,455 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 14:29:53,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:53,506 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 14:29:53,506 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 14:29:53,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 55 states and 67 transitions. Complement of second has 8 states. [2018-11-18 14:29:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:29:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:29:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 14:29:53,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 14:29:53,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:53,538 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:29:53,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:53,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 14:29:53,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 14:29:53,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 55 states and 67 transitions. Complement of second has 8 states. [2018-11-18 14:29:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:29:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:29:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 14:29:53,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 14:29:53,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:53,620 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:29:53,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:29:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:29:53,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:29:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:29:53,680 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 14:29:53,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-18 14:29:53,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2018-11-18 14:29:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 14:29:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:29:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-18 14:29:53,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 14:29:53,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:53,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 14:29:53,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:53,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 14:29:53,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:29:53,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2018-11-18 14:29:53,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:29:53,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2018-11-18 14:29:53,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:29:53,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:29:53,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:29:53,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:29:53,714 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:53,714 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:53,714 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:29:53,715 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:29:53,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:29:53,715 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:29:53,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:29:53,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:29:53 BoogieIcfgContainer [2018-11-18 14:29:53,723 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:29:53,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:29:53,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:29:53,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:29:53,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:29:22" (3/4) ... [2018-11-18 14:29:53,726 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:29:53,726 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:29:53,727 INFO L168 Benchmark]: Toolchain (without parser) took 31976.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 376.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:53,727 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:53,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:53,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:53,729 INFO L168 Benchmark]: Boogie Preprocessor took 19.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:53,729 INFO L168 Benchmark]: RCFGBuilder took 195.99 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:53,729 INFO L168 Benchmark]: BuchiAutomizer took 31383.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:29:53,730 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:29:53,733 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 195.99 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 31383.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 18.6s. Construction of modules took 0.1s. Büchi inclusion checks took 12.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 111 SDtfs, 143 SDslu, 121 SDs, 0 SdLazy, 157 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf99 lsp91 ukn72 mio100 lsp32 div131 bol100 ite100 ukn100 eq165 hnf77 smp87 dnf1072 smp33 tf100 neg94 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 178ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 12 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 280 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...