./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash 5f5357e64289d6bac41f74df7b40a85eebbaa806 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:42:29,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:42:29,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:42:29,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:42:29,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:42:29,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:42:29,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:42:29,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:42:29,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:42:29,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:42:29,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:42:29,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:42:29,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:42:29,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:42:29,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:42:29,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:42:29,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:42:29,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:42:29,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:42:29,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:42:29,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:42:29,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:42:29,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:42:29,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:42:29,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:42:29,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:42:29,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:42:29,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:42:29,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:42:29,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:42:29,208 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:42:29,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:42:29,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:42:29,209 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:42:29,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:42:29,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:42:29,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:42:29,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:42:29,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:42:29,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:42:29,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:42:29,256 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:42:29,257 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:42:29,257 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:42:29,257 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:42:29,257 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:42:29,257 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:42:29,257 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:42:29,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:42:29,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:42:29,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:42:29,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:42:29,259 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:42:29,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:42:29,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:42:29,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:42:29,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:42:29,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:42:29,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:42:29,262 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:42:29,262 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:42:29,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:42:29,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:42:29,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:42:29,263 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:42:29,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:42:29,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:42:29,264 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:42:29,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:42:29,265 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2018-11-28 23:42:29,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:42:29,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:42:29,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:42:29,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:42:29,353 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:42:29,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 23:42:29,410 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1382c4a34/f0985af7a41c43e693c68b57c4da28d4/FLAG989684c99 [2018-11-28 23:42:29,859 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:42:29,860 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 23:42:29,869 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1382c4a34/f0985af7a41c43e693c68b57c4da28d4/FLAG989684c99 [2018-11-28 23:42:30,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1382c4a34/f0985af7a41c43e693c68b57c4da28d4 [2018-11-28 23:42:30,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:42:30,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:42:30,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:42:30,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:42:30,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:42:30,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77076ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30, skipping insertion in model container [2018-11-28 23:42:30,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:42:30,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:42:30,526 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:42:30,538 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:42:30,568 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:42:30,597 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:42:30,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30 WrapperNode [2018-11-28 23:42:30,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:42:30,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:42:30,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:42:30,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:42:30,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:42:30,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:42:30,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:42:30,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:42:30,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... [2018-11-28 23:42:30,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:42:30,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:42:30,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:42:30,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:42:30,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:30,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:42:30,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:42:30,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:42:30,840 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-11-28 23:42:30,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:42:30,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:42:30,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:42:31,450 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:42:31,450 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-11-28 23:42:31,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:31 BoogieIcfgContainer [2018-11-28 23:42:31,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:42:31,452 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:42:31,453 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:42:31,457 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:42:31,458 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:31,458 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:42:30" (1/3) ... [2018-11-28 23:42:31,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@92e3b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:42:31, skipping insertion in model container [2018-11-28 23:42:31,460 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:31,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:30" (2/3) ... [2018-11-28 23:42:31,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@92e3b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:42:31, skipping insertion in model container [2018-11-28 23:42:31,462 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:31,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:31" (3/3) ... [2018-11-28 23:42:31,465 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-28 23:42:31,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:42:31,532 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:42:31,533 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:42:31,533 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:42:31,533 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:42:31,533 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:42:31,533 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:42:31,534 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:42:31,534 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:42:31,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-28 23:42:31,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:31,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:31,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:31,582 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:42:31,582 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:31,582 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:42:31,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-28 23:42:31,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:31,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:31,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:31,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:42:31,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:31,595 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2018-11-28 23:42:31,596 INFO L796 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2018-11-28 23:42:31,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:42:31,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:31,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:31,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2018-11-28 23:42:31,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:31,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:31,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:31,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2018-11-28 23:42:31,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:31,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:31,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:32,073 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:32,250 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 23:42:32,629 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-28 23:42:32,727 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:32,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:32,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:32,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:32,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:32,731 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:32,731 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:32,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:32,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:42:32,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:32,732 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:32,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,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-28 23:42:32,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-28 23:42:32,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:32,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,541 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:42:33,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,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-28 23:42:33,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-28 23:42:33,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:33,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:34,205 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:34,211 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:34,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:34,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:34,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,346 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:42:34,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:42:34,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:34,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,384 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:34,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,388 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:34,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:34,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:34,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:34,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:34,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:34,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:34,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:34,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:34,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:34,573 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:42:34,573 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-28 23:42:34,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:34,578 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:34,579 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:34,580 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-28 23:42:34,655 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:42:34,665 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:34,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:34,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:34,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:34,811 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-28 23:42:34,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2018-11-28 23:42:35,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 96 states and 135 transitions. Complement of second has 7 states. [2018-11-28 23:42:35,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:42:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2018-11-28 23:42:35,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-28 23:42:35,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:42:35,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-28 23:42:35,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2018-11-28 23:42:35,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:35,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 40 states and 55 transitions. [2018-11-28 23:42:35,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:42:35,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:42:35,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2018-11-28 23:42:35,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:35,072 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2018-11-28 23:42:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2018-11-28 23:42:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-28 23:42:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 23:42:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-11-28 23:42:35,101 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-28 23:42:35,101 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-28 23:42:35,102 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:42:35,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2018-11-28 23:42:35,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:35,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:35,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:35,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:35,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:35,106 INFO L794 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 226#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 227#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 209#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 210#L54 assume parse_expression_list_#t~switch4; 220#L55-5 [2018-11-28 23:42:35,106 INFO L796 eck$LassoCheckResult]: Loop: 220#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 221#L55-1 assume parse_expression_list_#t~short7; 224#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 220#L55-5 [2018-11-28 23:42:35,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2018-11-28 23:42:35,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2018-11-28 23:42:35,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,162 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2018-11-28 23:42:35,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:35,598 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-28 23:42:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:42:35,992 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-28 23:42:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:42:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:42:36,040 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-28 23:42:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:36,259 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2018-11-28 23:42:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:42:36,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2018-11-28 23:42:36,265 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:42:36,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2018-11-28 23:42:36,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:42:36,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:36,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2018-11-28 23:42:36,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:36,268 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2018-11-28 23:42:36,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2018-11-28 23:42:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2018-11-28 23:42:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:42:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2018-11-28 23:42:36,273 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-11-28 23:42:36,273 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-11-28 23:42:36,273 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:42:36,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2018-11-28 23:42:36,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:36,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:36,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:36,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:36,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:36,276 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 351#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 332#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 333#L54 assume !parse_expression_list_#t~switch4; 342#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 347#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 336#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 334#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 335#L54 assume parse_expression_list_#t~switch4; 343#L55-5 [2018-11-28 23:42:36,276 INFO L796 eck$LassoCheckResult]: Loop: 343#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 344#L55-1 assume parse_expression_list_#t~short7; 377#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 343#L55-5 [2018-11-28 23:42:36,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2018-11-28 23:42:36,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:36,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:36,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:36,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2018-11-28 23:42:36,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:36,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2018-11-28 23:42:36,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:36,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:36,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:36,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:36,789 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2018-11-28 23:42:36,975 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-28 23:42:36,979 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:36,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:36,980 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:36,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:36,980 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:36,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:36,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:36,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:36,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 23:42:36,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:36,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:36,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:36,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,382 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-11-28 23:42:37,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:37,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:37,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:37,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:37,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:37,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:37,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:37,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:37,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:37,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:37,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:37,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:37,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:37,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:37,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:37,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:37,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:37,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:37,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,941 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:37,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,943 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:37,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:37,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:37,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:37,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:37,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:37,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:37,987 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:37,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:37,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:37,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:37,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:38,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:38,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:38,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:38,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:38,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:38,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:38,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:38,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:38,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:38,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:38,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:38,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:38,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:38,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:38,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:38,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:38,055 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:38,068 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:42:38,068 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:42:38,068 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:38,070 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:38,071 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:38,071 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2) = -1*ULTIMATE.start_parse_expression_list_~start~0 - 1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 Supporting invariants [] [2018-11-28 23:42:38,133 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:42:38,134 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:38,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:38,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:38,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:42:38,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-28 23:42:38,392 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 153 states and 213 transitions. Complement of second has 7 states. [2018-11-28 23:42:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-28 23:42:38,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:42:38,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 23:42:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:38,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:42:38,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:38,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2018-11-28 23:42:38,397 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-28 23:42:38,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2018-11-28 23:42:38,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-28 23:42:38,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-28 23:42:38,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2018-11-28 23:42:38,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:38,402 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2018-11-28 23:42:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2018-11-28 23:42:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2018-11-28 23:42:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 23:42:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-28 23:42:38,411 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-28 23:42:38,411 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-28 23:42:38,411 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:42:38,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2018-11-28 23:42:38,414 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:38,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:38,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:38,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:38,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:38,416 INFO L794 eck$LassoCheckResult]: Stem: 675#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 651#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 652#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 630#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 631#L54 assume parse_expression_list_#t~switch4; 658#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 676#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 648#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 636#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 637#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 660#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 661#L58-8 [2018-11-28 23:42:38,416 INFO L796 eck$LassoCheckResult]: Loop: 661#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 668#L58-1 assume !parse_expression_list_#t~short14; 654#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 661#L58-8 [2018-11-28 23:42:38,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2018-11-28 23:42:38,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:38,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2018-11-28 23:42:38,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:38,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:42:38,497 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:42:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:42:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:42:38,498 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-28 23:42:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:38,537 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-11-28 23:42:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:42:38,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2018-11-28 23:42:38,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:38,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2018-11-28 23:42:38,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:42:38,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:38,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2018-11-28 23:42:38,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:38,543 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-11-28 23:42:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2018-11-28 23:42:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-28 23:42:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 23:42:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2018-11-28 23:42:38,552 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-11-28 23:42:38,552 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2018-11-28 23:42:38,552 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:42:38,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2018-11-28 23:42:38,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:38,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:38,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:38,556 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:38,557 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:38,557 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 802#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 803#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 782#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 783#L54 assume parse_expression_list_#t~switch4; 794#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 795#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 835#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 832#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 815#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 806#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 807#L58-8 [2018-11-28 23:42:38,557 INFO L796 eck$LassoCheckResult]: Loop: 807#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 819#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 816#L58-2 assume parse_expression_list_#t~short13; 810#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 811#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 807#L58-8 [2018-11-28 23:42:38,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 2 times [2018-11-28 23:42:38,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:38,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2018-11-28 23:42:38,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:38,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2018-11-28 23:42:38,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:38,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-28 23:42:38,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:38,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:42:38,838 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 23:42:38,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:42:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:42:38,852 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-11-28 23:42:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:38,968 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2018-11-28 23:42:38,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:38,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 161 transitions. [2018-11-28 23:42:38,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:38,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 148 transitions. [2018-11-28 23:42:38,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:38,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:38,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 148 transitions. [2018-11-28 23:42:38,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:38,975 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 148 transitions. [2018-11-28 23:42:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 148 transitions. [2018-11-28 23:42:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 77. [2018-11-28 23:42:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 23:42:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2018-11-28 23:42:38,982 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2018-11-28 23:42:38,982 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. [2018-11-28 23:42:38,982 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:42:38,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. [2018-11-28 23:42:38,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:38,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:38,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:38,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:38,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:38,987 INFO L794 eck$LassoCheckResult]: Stem: 1041#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1015#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1016#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 995#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 996#L54 assume !parse_expression_list_#t~switch4; 1018#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1071#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1070#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1064#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1017#L54 assume parse_expression_list_#t~switch4; 1019#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1009#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1069#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 1000#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1001#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1021#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1022#L58-8 [2018-11-28 23:42:38,987 INFO L796 eck$LassoCheckResult]: Loop: 1022#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1034#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1031#L58-2 assume parse_expression_list_#t~short13; 1025#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1026#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1022#L58-8 [2018-11-28 23:42:38,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:38,988 INFO L82 PathProgramCache]: Analyzing trace with hash -960269922, now seen corresponding path program 1 times [2018-11-28 23:42:38,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:38,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:38,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:38,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2018-11-28 23:42:39,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:39,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash -554161477, now seen corresponding path program 1 times [2018-11-28 23:42:39,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:39,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:39,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:39,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:39,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:39,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:39,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:42:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:39,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:39,318 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. cyclomatic complexity: 33 Second operand 7 states. [2018-11-28 23:42:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:39,481 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2018-11-28 23:42:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:42:39,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 222 transitions. [2018-11-28 23:42:39,486 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-28 23:42:39,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 150 states and 200 transitions. [2018-11-28 23:42:39,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 23:42:39,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 23:42:39,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-11-28 23:42:39,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:39,491 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-11-28 23:42:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-11-28 23:42:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-11-28 23:42:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-28 23:42:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 156 transitions. [2018-11-28 23:42:39,500 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-11-28 23:42:39,500 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 156 transitions. [2018-11-28 23:42:39,500 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:42:39,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 156 transitions. [2018-11-28 23:42:39,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:39,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:39,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:39,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:39,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:39,505 INFO L794 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1340#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1341#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1319#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1320#L54 assume !parse_expression_list_#t~switch4; 1418#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1417#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1416#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1415#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1414#L54 assume !parse_expression_list_#t~switch4; 1378#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1427#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1382#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1381#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1377#L54 assume parse_expression_list_#t~switch4; 1330#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1331#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1364#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 1323#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1324#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1343#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1344#L58-8 [2018-11-28 23:42:39,505 INFO L796 eck$LassoCheckResult]: Loop: 1344#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1356#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1353#L58-2 assume parse_expression_list_#t~short13; 1347#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1348#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1344#L58-8 [2018-11-28 23:42:39,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 2 times [2018-11-28 23:42:39,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:39,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:39,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2018-11-28 23:42:39,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:39,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:39,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:39,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 2 times [2018-11-28 23:42:39,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:39,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:39,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:39,959 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 23:42:40,543 WARN L180 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 118 [2018-11-28 23:42:40,662 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-28 23:42:40,665 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:40,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:40,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:40,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:40,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:40,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:40,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:40,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:40,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 23:42:40,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:40,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:40,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:40,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:41,243 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2018-11-28 23:42:41,833 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-28 23:42:41,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:41,981 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:41,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:41,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:41,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:41,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:41,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:41,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:41,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:41,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:41,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:41,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:41,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:41,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:41,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:41,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:41,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:41,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:41,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:41,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:41,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:41,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:41,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:41,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:41,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:41,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:41,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:41,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:41,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:41,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:41,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:41,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:41,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:41,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:41,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:41,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:41,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:41,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:41,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:41,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:41,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:41,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:42,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:42,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:42,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,069 INFO L205 nArgumentSynthesizer]: 5 stem disjuncts [2018-11-28 23:42:42,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,070 INFO L402 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2018-11-28 23:42:42,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,092 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:42,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,096 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:42,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:42,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:42,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:42,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:42,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:42,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:42,129 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:42,165 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:42:42,166 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:42:42,166 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:42,167 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:42,167 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:42,167 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-11-28 23:42:42,278 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-28 23:42:42,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:42,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:42,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:42,353 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:42:42,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49 Second operand 4 states. [2018-11-28 23:42:42,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 156 transitions. cyclomatic complexity: 49. Second operand 4 states. Result 271 states and 365 transitions. Complement of second has 11 states. [2018-11-28 23:42:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:42:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-28 23:42:42,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-28 23:42:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:42,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-28 23:42:42,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:42,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-28 23:42:42,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:42,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 365 transitions. [2018-11-28 23:42:42,655 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2018-11-28 23:42:42,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 174 states and 233 transitions. [2018-11-28 23:42:42,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:42,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:42,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 233 transitions. [2018-11-28 23:42:42,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:42,661 INFO L705 BuchiCegarLoop]: Abstraction has 174 states and 233 transitions. [2018-11-28 23:42:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 233 transitions. [2018-11-28 23:42:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 122. [2018-11-28 23:42:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 23:42:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2018-11-28 23:42:42,681 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2018-11-28 23:42:42,682 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 163 transitions. [2018-11-28 23:42:42,682 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:42:42,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 163 transitions. [2018-11-28 23:42:42,683 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:42,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:42,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:42,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:42,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:42,691 INFO L794 eck$LassoCheckResult]: Stem: 1924#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1900#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 1901#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1880#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1881#L54 assume parse_expression_list_#t~switch4; 1982#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1987#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1985#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 1983#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1980#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1978#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1976#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1974#L58-1 assume !parse_expression_list_#t~short14; 1972#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 1969#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1968#L59 assume !parse_expression_list_#t~short17; 1966#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 1964#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 1962#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1959#L3 assume !(0 == __VERIFIER_assert_~cond); 1958#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 1955#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 1951#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1948#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1945#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1944#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1943#L54 assume parse_expression_list_#t~switch4; 1897#L55-5 [2018-11-28 23:42:42,695 INFO L796 eck$LassoCheckResult]: Loop: 1897#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1940#L55-1 assume parse_expression_list_#t~short7; 1896#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1897#L55-5 [2018-11-28 23:42:42,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1008934689, now seen corresponding path program 1 times [2018-11-28 23:42:42,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:42,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:42,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:43,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:43,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:42:43,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2018-11-28 23:42:43,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:43,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:43,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:43,604 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-28 23:42:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:43,617 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. cyclomatic complexity: 50 Second operand 7 states. [2018-11-28 23:42:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:43,878 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2018-11-28 23:42:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:42:43,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 282 transitions. [2018-11-28 23:42:43,883 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2018-11-28 23:42:43,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 175 states and 230 transitions. [2018-11-28 23:42:43,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-28 23:42:43,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-28 23:42:43,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 230 transitions. [2018-11-28 23:42:43,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:43,885 INFO L705 BuchiCegarLoop]: Abstraction has 175 states and 230 transitions. [2018-11-28 23:42:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 230 transitions. [2018-11-28 23:42:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2018-11-28 23:42:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-28 23:42:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2018-11-28 23:42:43,891 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2018-11-28 23:42:43,891 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 164 transitions. [2018-11-28 23:42:43,891 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:42:43,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 164 transitions. [2018-11-28 23:42:43,892 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:43,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:43,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:43,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:43,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:43,893 INFO L794 eck$LassoCheckResult]: Stem: 2280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2252#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2253#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2233#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2234#L54 assume parse_expression_list_#t~switch4; 2315#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2314#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2313#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2312#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2311#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2310#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2309#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2308#L58-1 assume !parse_expression_list_#t~short14; 2307#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 2306#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2294#L59 assume !parse_expression_list_#t~short17; 2295#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2305#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2303#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2301#L3 assume !(0 == __VERIFIER_assert_~cond); 2299#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2242#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2243#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2304#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2302#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2300#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2298#L54 assume parse_expression_list_#t~switch4; 2244#L55-5 [2018-11-28 23:42:43,893 INFO L796 eck$LassoCheckResult]: Loop: 2244#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2245#L55-1 assume parse_expression_list_#t~short7; 2250#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2244#L55-5 [2018-11-28 23:42:43,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2018-11-28 23:42:43,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:43,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:43,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:44,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:44,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:42:44,049 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:44,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2018-11-28 23:42:44,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:44,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:42:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:42:44,105 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. cyclomatic complexity: 48 Second operand 6 states. [2018-11-28 23:42:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:44,242 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2018-11-28 23:42:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:44,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2018-11-28 23:42:44,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:44,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 98 states and 132 transitions. [2018-11-28 23:42:44,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:42:44,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:42:44,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 132 transitions. [2018-11-28 23:42:44,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:44,247 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-11-28 23:42:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 132 transitions. [2018-11-28 23:42:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-28 23:42:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 23:42:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2018-11-28 23:42:44,251 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-11-28 23:42:44,251 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 132 transitions. [2018-11-28 23:42:44,251 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:42:44,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 132 transitions. [2018-11-28 23:42:44,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:44,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:44,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:44,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:44,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:44,253 INFO L794 eck$LassoCheckResult]: Stem: 2526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2502#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2503#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2483#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2484#L54 assume !parse_expression_list_#t~switch4; 2504#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2567#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2565#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2562#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2560#L54 assume parse_expression_list_#t~switch4; 2497#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2498#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2578#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2579#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2580#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2507#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2508#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2518#L58-1 assume !parse_expression_list_#t~short14; 2519#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 2532#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2531#L59 assume !parse_expression_list_#t~short17; 2529#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2527#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2523#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2516#L3 assume !(0 == __VERIFIER_assert_~cond); 2513#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2492#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2493#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2577#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2576#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2574#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2572#L54 assume parse_expression_list_#t~switch4; 2495#L55-5 [2018-11-28 23:42:44,253 INFO L796 eck$LassoCheckResult]: Loop: 2495#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2496#L55-1 assume parse_expression_list_#t~short7; 2500#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2495#L55-5 [2018-11-28 23:42:44,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1171373033, now seen corresponding path program 1 times [2018-11-28 23:42:44,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:42:44,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:44,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 23:42:44,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:44,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:44,337 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2018-11-28 23:42:44,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:44,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:44,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:42:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:42:44,414 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. cyclomatic complexity: 41 Second operand 8 states. [2018-11-28 23:42:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:44,636 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2018-11-28 23:42:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:42:44,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 232 transitions. [2018-11-28 23:42:44,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:42:44,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 149 states and 201 transitions. [2018-11-28 23:42:44,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-28 23:42:44,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-28 23:42:44,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 201 transitions. [2018-11-28 23:42:44,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:44,644 INFO L705 BuchiCegarLoop]: Abstraction has 149 states and 201 transitions. [2018-11-28 23:42:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 201 transitions. [2018-11-28 23:42:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2018-11-28 23:42:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 23:42:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2018-11-28 23:42:44,647 INFO L728 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2018-11-28 23:42:44,647 INFO L608 BuchiCegarLoop]: Abstraction has 117 states and 158 transitions. [2018-11-28 23:42:44,647 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:42:44,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 158 transitions. [2018-11-28 23:42:44,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:44,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:44,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:44,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:44,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:44,649 INFO L794 eck$LassoCheckResult]: Stem: 2822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2795#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc(2); 2796#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2774#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2775#L54 assume !parse_expression_list_#t~switch4; 2797#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2786#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2787#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2776#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2777#L54 assume parse_expression_list_#t~switch4; 2790#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2791#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2884#L55-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 2883#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2807#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2800#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2801#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2818#L58-1 assume !parse_expression_list_#t~short14; 2837#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 2835#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2833#L59 assume !parse_expression_list_#t~short17; 2832#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2824#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2819#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2811#L3 assume !(0 == __VERIFIER_assert_~cond); 2806#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2784#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2785#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2830#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2829#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2828#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2825#L54 assume parse_expression_list_#t~switch4; 2788#L55-5 [2018-11-28 23:42:44,650 INFO L796 eck$LassoCheckResult]: Loop: 2788#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2789#L55-1 assume parse_expression_list_#t~short7; 2792#L55-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 2788#L55-5 [2018-11-28 23:42:44,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2018-11-28 23:42:44,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:42:44,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:44,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:44,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:44,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:44,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:42:44,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:42:44,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:42:44,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-28 23:42:45,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-28 23:42:45,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 23:42:45,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 23:42:45,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2018-11-28 23:42:45,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-28 23:42:45,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-28 23:42:45,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-28 23:42:45,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:42:45,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2018-11-28 23:42:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:42:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-28 23:42:45,471 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:45,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2018-11-28 23:42:45,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:45,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:45,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:45,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:45,984 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-28 23:42:46,150 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 23:42:46,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 23:42:46,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-28 23:42:46,153 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. cyclomatic complexity: 48 Second operand 16 states. [2018-11-28 23:42:47,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:47,151 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-11-28 23:42:47,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:42:47,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 97 transitions. [2018-11-28 23:42:47,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:42:47,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-11-28 23:42:47,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:42:47,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:42:47,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:42:47,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:47,155 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:47,155 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:47,155 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:42:47,155 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:42:47,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:42:47,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:42:47,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:42:47,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:42:47 BoogieIcfgContainer [2018-11-28 23:42:47,163 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:42:47,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:42:47,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:42:47,164 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:42:47,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:31" (3/4) ... [2018-11-28 23:42:47,168 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:42:47,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:42:47,169 INFO L168 Benchmark]: Toolchain (without parser) took 16964.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -322.8 MB). Peak memory consumption was 707.8 kB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,170 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:47,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,172 INFO L168 Benchmark]: Boogie Preprocessor took 45.03 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,173 INFO L168 Benchmark]: RCFGBuilder took 675.28 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,174 INFO L168 Benchmark]: BuchiAutomizer took 15710.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.3 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:42:47,175 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:42:47,180 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.03 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 675.28 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15710.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.3 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 11 terminating modules (8 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * str + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * start + -1 * str + unknown-#length-unknown[str] and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 12.1s. Construction of modules took 1.5s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 272 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 341 SDtfs, 842 SDslu, 818 SDs, 0 SdLazy, 859 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU4 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf101 lsp90 ukn74 mio100 lsp43 div100 bol100 ite100 ukn100 eq183 hnf86 smp96 dnf205 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 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...