./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-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/veris.c_OpenSER__cases1_stripFullBoth_arr_true-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 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:42:21,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:42:21,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:42:21,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:42:21,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:42:21,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:42:21,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:42:21,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:42:21,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:42:21,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:42:21,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:42:21,339 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:42:21,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:42:21,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:42:21,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:42:21,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:42:21,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:42:21,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:42:21,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:42:21,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:42:21,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:42:21,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:42:21,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:42:21,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:42:21,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:42:21,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:42:21,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:42:21,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:42:21,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:42:21,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:42:21,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:42:21,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:42:21,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:42:21,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:42:21,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:42:21,389 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:21,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:42:21,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:42:21,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:42:21,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:42:21,429 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:42:21,429 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:42:21,429 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:42:21,429 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:42:21,429 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:42:21,430 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:42:21,430 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:42:21,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:42:21,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:42:21,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:42:21,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:42:21,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:42:21,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:42:21,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:42:21,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:42:21,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:42:21,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:42:21,433 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:42:21,435 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:42:21,435 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:42:21,435 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:42:21,435 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:42:21,435 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:42:21,436 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:42:21,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:42:21,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:42:21,436 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:42:21,437 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:42:21,437 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 -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2018-11-28 23:42:21,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:42:21,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:42:21,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:42:21,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:42:21,531 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:42:21,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-28 23:42:21,599 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262ef05fd/ed2e88af25084b5caec84d2afb523f80/FLAGf14b79c6e [2018-11-28 23:42:22,025 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:42:22,026 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-28 23:42:22,034 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262ef05fd/ed2e88af25084b5caec84d2afb523f80/FLAGf14b79c6e [2018-11-28 23:42:22,407 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262ef05fd/ed2e88af25084b5caec84d2afb523f80 [2018-11-28 23:42:22,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:42:22,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:42:22,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:42:22,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:42:22,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:42:22,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:22" (1/1) ... [2018-11-28 23:42:22,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0e4c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:22, skipping insertion in model container [2018-11-28 23:42:22,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:22" (1/1) ... [2018-11-28 23:42:22,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:42:22,456 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:42:22,695 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:42:22,708 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:42:22,770 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:42:22,799 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:42:22,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:22 WrapperNode [2018-11-28 23:42:22,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:42:22,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:42:22,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:42:22,801 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:42:22,808 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:22" (1/1) ... [2018-11-28 23:42:22,819 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:22" (1/1) ... [2018-11-28 23:42:22,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:42:22,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:42:22,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:42:22,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:42:22,930 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:22" (1/1) ... [2018-11-28 23:42:22,930 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:22" (1/1) ... [2018-11-28 23:42:22,933 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:22" (1/1) ... [2018-11-28 23:42:22,933 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:22" (1/1) ... [2018-11-28 23:42:22,941 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:22" (1/1) ... [2018-11-28 23:42:22,947 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:22" (1/1) ... [2018-11-28 23:42:22,949 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:22" (1/1) ... [2018-11-28 23:42:22,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:42:22,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:42:22,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:42:22,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:42:22,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:22" (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:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:42:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:42:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:42:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2018-11-28 23:42:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:42:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:42:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:42:23,604 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:42:23,604 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-28 23:42:23,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:23 BoogieIcfgContainer [2018-11-28 23:42:23,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:42:23,606 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:42:23,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:42:23,610 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:42:23,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:23,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:42:22" (1/3) ... [2018-11-28 23:42:23,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@242775ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:42:23, skipping insertion in model container [2018-11-28 23:42:23,613 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:23,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:22" (2/3) ... [2018-11-28 23:42:23,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@242775ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:42:23, skipping insertion in model container [2018-11-28 23:42:23,614 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:42:23,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:23" (3/3) ... [2018-11-28 23:42:23,616 INFO L375 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-28 23:42:23,675 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:42:23,676 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:42:23,676 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:42:23,676 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:42:23,677 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:42:23,677 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:42:23,677 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:42:23,677 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:42:23,677 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:42:23,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-11-28 23:42:23,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-28 23:42:23,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:23,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:23,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:42:23,730 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:23,730 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:42:23,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-11-28 23:42:23,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-28 23:42:23,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:23,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:23,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:42:23,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:42:23,743 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 31#L79-3true [2018-11-28 23:42:23,743 INFO L796 eck$LassoCheckResult]: Loop: 31#L79-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 36#L79-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 31#L79-3true [2018-11-28 23:42:23,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:42:23,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:23,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:23,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:23,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:42:23,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:23,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:42:23,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:24,156 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 23:42:24,281 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:42:24,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:24,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:24,339 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:24,339 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:24,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:24,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:24,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:24,341 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:24,341 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:42:24,341 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:24,341 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:24,364 INFO 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:24,440 INFO 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:24,444 INFO 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:24,450 INFO 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:24,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:24,459 INFO 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:24,766 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:24,772 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:24,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:24,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:24,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:24,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:24,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:24,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:24,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:24,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:24,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:24,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:24,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:24,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:24,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:24,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:24,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:24,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:24,870 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:24,909 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:42:24,909 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:42:24,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:24,915 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:24,915 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:24,916 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_main_~i~1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-28 23:42:24,933 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:42:24,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:25,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:25,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:25,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:25,308 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:25,329 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:25,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2018-11-28 23:42:25,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 102 states and 153 transitions. Complement of second has 8 states. [2018-11-28 23:42:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2018-11-28 23:42:25,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:42:25,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:25,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:42:25,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:25,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:42:25,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:25,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2018-11-28 23:42:25,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:25,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2018-11-28 23:42:25,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:42:25,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:25,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2018-11-28 23:42:25,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:25,633 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-11-28 23:42:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2018-11-28 23:42:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-28 23:42:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:42:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2018-11-28 23:42:25,663 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-11-28 23:42:25,663 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2018-11-28 23:42:25,663 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:42:25,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2018-11-28 23:42:25,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:25,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:25,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:25,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:25,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:25,667 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 194#L79-3 assume !(main_~i~1 < 8); 209#L79-4 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); 189#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 190#L52-4 [2018-11-28 23:42:25,667 INFO L796 eck$LassoCheckResult]: Loop: 190#L52-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; 203#L55 assume !parse_expression_list_#t~switch4; 198#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 199#L52-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); 205#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 190#L52-4 [2018-11-28 23:42:25,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2018-11-28 23:42:25,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:25,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:25,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:25,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:42:25,731 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:25,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2018-11-28 23:42:25,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:25,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:25,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:25,917 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:42:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:42:25,970 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:42:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:26,020 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2018-11-28 23:42:26,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:42:26,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-11-28 23:42:26,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2018-11-28 23:42:26,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:26,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:26,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2018-11-28 23:42:26,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:26,027 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:42:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2018-11-28 23:42:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-28 23:42:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 23:42:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2018-11-28 23:42:26,032 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-28 23:42:26,032 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-28 23:42:26,032 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:42:26,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2018-11-28 23:42:26,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:26,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:26,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:26,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:26,036 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 264#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 265#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 281#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 282#L79-3 assume !(main_~i~1 < 8); 280#L79-4 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); 258#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 259#L52-4 [2018-11-28 23:42:26,036 INFO L796 eck$LassoCheckResult]: Loop: 259#L52-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; 274#L55 assume !parse_expression_list_#t~switch4; 269#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 270#L52-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); 275#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 259#L52-4 [2018-11-28 23:42:26,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2018-11-28 23:42:26,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:26,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:26,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:26,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:26,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:26,077 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:26,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:26,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:42:26,151 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:26,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2018-11-28 23:42:26,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:26,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:26,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:42:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:42:26,271 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-28 23:42:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:26,303 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-28 23:42:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:42:26,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2018-11-28 23:42:26,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2018-11-28 23:42:26,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:26,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:26,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2018-11-28 23:42:26,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:26,310 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2018-11-28 23:42:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2018-11-28 23:42:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-28 23:42:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:42:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2018-11-28 23:42:26,313 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-28 23:42:26,313 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-28 23:42:26,314 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:42:26,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2018-11-28 23:42:26,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:26,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:26,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:42:26,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:26,317 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 357#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 358#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 374#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 375#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 376#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 380#L79-3 assume !(main_~i~1 < 8); 373#L79-4 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#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 352#L52-4 [2018-11-28 23:42:26,317 INFO L796 eck$LassoCheckResult]: Loop: 352#L52-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; 367#L55 assume !parse_expression_list_#t~switch4; 362#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 363#L52-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); 368#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 352#L52-4 [2018-11-28 23:42:26,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2018-11-28 23:42:26,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:26,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:26,382 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:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:42:26,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:42:26,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:26,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:26,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:42:26,533 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:26,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2018-11-28 23:42:26,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:26,872 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:42:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:42:26,896 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-28 23:42:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:26,952 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-28 23:42:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:42:26,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-28 23:42:26,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2018-11-28 23:42:26,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:26,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:26,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2018-11-28 23:42:26,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:26,959 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-28 23:42:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2018-11-28 23:42:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-28 23:42:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 23:42:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-11-28 23:42:26,963 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-28 23:42:26,963 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2018-11-28 23:42:26,963 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:42:26,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2018-11-28 23:42:26,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:26,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:26,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:26,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2018-11-28 23:42:26,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:26,967 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 462#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 478#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 484#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 486#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 479#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 480#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 485#L79-3 assume !(main_~i~1 < 8); 477#L79-4 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); 455#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 456#L52-4 [2018-11-28 23:42:26,967 INFO L796 eck$LassoCheckResult]: Loop: 456#L52-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; 471#L55 assume !parse_expression_list_#t~switch4; 466#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 467#L52-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); 472#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 456#L52-4 [2018-11-28 23:42:26,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2018-11-28 23:42:26,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:27,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:27,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:42:27,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:42:27,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:27,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:27,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:42:27,170 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:27,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,170 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2018-11-28 23:42:27,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:27,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:27,322 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:27,346 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:42:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:27,377 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-11-28 23:42:27,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:42:27,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2018-11-28 23:42:27,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:27,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2018-11-28 23:42:27,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:27,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:27,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2018-11-28 23:42:27,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:27,385 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-28 23:42:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2018-11-28 23:42:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-28 23:42:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 23:42:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-28 23:42:27,390 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-28 23:42:27,390 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-28 23:42:27,390 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:42:27,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2018-11-28 23:42:27,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:27,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:27,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:27,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2018-11-28 23:42:27,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:27,393 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 576#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 577#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 593#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 594#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 595#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 603#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 602#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 601#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 600#L79-3 assume !(main_~i~1 < 8); 592#L79-4 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); 570#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 571#L52-4 [2018-11-28 23:42:27,393 INFO L796 eck$LassoCheckResult]: Loop: 571#L52-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; 586#L55 assume !parse_expression_list_#t~switch4; 581#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 582#L52-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); 587#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 571#L52-4 [2018-11-28 23:42:27,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2018-11-28 23:42:27,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:27,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:42:27,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:42:27,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:27,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:42:27,566 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:27,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2018-11-28 23:42:27,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:27,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:27,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:42:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:42:27,670 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-28 23:42:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:27,712 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-28 23:42:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:27,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2018-11-28 23:42:27,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:27,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2018-11-28 23:42:27,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:27,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:27,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2018-11-28 23:42:27,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:27,717 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-28 23:42:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2018-11-28 23:42:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-28 23:42:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:42:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-11-28 23:42:27,723 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-28 23:42:27,723 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-11-28 23:42:27,723 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:42:27,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2018-11-28 23:42:27,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:27,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:27,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:27,726 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2018-11-28 23:42:27,726 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:27,728 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 702#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 703#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 719#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 720#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 721#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 725#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 731#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 730#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 729#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 728#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 727#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 726#L79-3 assume !(main_~i~1 < 8); 718#L79-4 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); 696#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 697#L52-4 [2018-11-28 23:42:27,728 INFO L796 eck$LassoCheckResult]: Loop: 697#L52-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; 712#L55 assume !parse_expression_list_#t~switch4; 707#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 708#L52-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); 713#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 697#L52-4 [2018-11-28 23:42:27,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2018-11-28 23:42:27,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:27,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:27,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:27,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:27,849 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:42:27,877 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:42:27,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:27,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:27,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:27,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:42:27,912 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:27,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2018-11-28 23:42:27,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:27,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,432 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:42:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:42:28,449 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-28 23:42:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:28,491 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-28 23:42:28,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:42:28,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2018-11-28 23:42:28,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:28,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2018-11-28 23:42:28,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:28,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:28,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2018-11-28 23:42:28,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:28,497 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-28 23:42:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2018-11-28 23:42:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-28 23:42:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 23:42:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-11-28 23:42:28,501 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-28 23:42:28,501 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-11-28 23:42:28,501 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:42:28,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2018-11-28 23:42:28,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:28,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:28,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:28,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2018-11-28 23:42:28,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:28,503 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 839#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 840#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 856#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 857#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 862#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 869#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 867#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 865#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 863#L79-3 assume !(main_~i~1 < 8); 855#L79-4 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); 833#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 834#L52-4 [2018-11-28 23:42:28,503 INFO L796 eck$LassoCheckResult]: Loop: 834#L52-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; 849#L55 assume !parse_expression_list_#t~switch4; 844#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 845#L52-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); 850#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 834#L52-4 [2018-11-28 23:42:28,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2018-11-28 23:42:28,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:28,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:42:28,640 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:42:28,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:42:28,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:28,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:28,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:42:28,684 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:28,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2018-11-28 23:42:28,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:28,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:42:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:42:28,814 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-28 23:42:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:28,848 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-28 23:42:28,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:42:28,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2018-11-28 23:42:28,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:28,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2018-11-28 23:42:28,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:28,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:28,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2018-11-28 23:42:28,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:28,855 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-28 23:42:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2018-11-28 23:42:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 23:42:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 23:42:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-28 23:42:28,858 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 23:42:28,858 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 23:42:28,858 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:42:28,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2018-11-28 23:42:28,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:28,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:28,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:28,860 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2018-11-28 23:42:28,860 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:28,860 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 987#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 988#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1004#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1005#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1006#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1010#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1020#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1019#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1018#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1017#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1016#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1015#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1014#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1013#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1012#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1011#L79-3 assume !(main_~i~1 < 8); 1003#L79-4 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); 983#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 984#L52-4 [2018-11-28 23:42:28,860 INFO L796 eck$LassoCheckResult]: Loop: 984#L52-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; 997#L55 assume !parse_expression_list_#t~switch4; 992#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 993#L52-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); 999#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 984#L52-4 [2018-11-28 23:42:28,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2018-11-28 23:42:28,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:28,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:28,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:28,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:29,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:29,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:29,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:29,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:42:29,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:29,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:42:29,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:29,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2018-11-28 23:42:29,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:42:29,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:42:29,243 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2018-11-28 23:42:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:29,398 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-28 23:42:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:42:29,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-28 23:42:29,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:29,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-28 23:42:29,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:29,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:29,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-28 23:42:29,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:42:29,403 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-28 23:42:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-28 23:42:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-28 23:42:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:42:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-28 23:42:29,409 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-28 23:42:29,409 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-28 23:42:29,409 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:42:29,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2018-11-28 23:42:29,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:42:29,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:29,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:29,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2018-11-28 23:42:29,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:29,413 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1145#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1146#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1162#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1163#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1164#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1168#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1179#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1178#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1177#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1176#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1175#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1171#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1170#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1169#L79-3 assume !(main_~i~1 < 8); 1161#L79-4 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); 1139#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1140#L52-4 [2018-11-28 23:42:29,413 INFO L796 eck$LassoCheckResult]: Loop: 1140#L52-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; 1155#L55 assume !parse_expression_list_#t~switch4; 1150#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1151#L52-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); 1156#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1140#L52-4 [2018-11-28 23:42:29,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2018-11-28 23:42:29,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:29,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2018-11-28 23:42:29,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:29,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:29,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2018-11-28 23:42:29,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:29,641 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-28 23:42:34,441 WARN L180 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 190 DAG size of output: 146 [2018-11-28 23:42:34,679 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 23:42:34,682 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:34,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:34,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:34,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:34,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:34,682 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:34,682 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:34,682 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:34,682 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-28 23:42:34,682 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:34,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:34,689 INFO 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,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:34,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:34,703 INFO 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,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:34,706 INFO 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,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:34,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:34,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:34,714 INFO 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,717 INFO 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,718 INFO 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,720 INFO 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,721 INFO 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,722 INFO 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,724 INFO 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,725 INFO 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,727 INFO 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,728 INFO 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,731 INFO 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,733 INFO 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,734 INFO 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,735 INFO 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,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:34,738 INFO 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,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:34,745 INFO 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,747 INFO 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,748 INFO 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:35,038 INFO 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:35,043 INFO 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:35,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:35,343 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:35,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,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:35,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,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:35,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:35,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:35,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:35,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:35,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:35,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,498 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:35,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:35,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:35,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:35,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:35,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:35,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:35,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:35,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:35,584 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:35,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:42:35,632 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:42:35,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:35,634 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:35,634 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:35,634 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.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:35,766 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:42:35,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:35,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:35,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:35,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:35,839 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,840 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:35,840 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:42:35,887 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 73 states and 92 transitions. Complement of second has 4 states. [2018-11-28 23:42:35,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:42:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-28 23:42:35,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-28 23:42:35,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-28 23:42:35,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-28 23:42:35,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:35,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2018-11-28 23:42:35,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:35,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2018-11-28 23:42:35,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:42:35,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:42:35,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2018-11-28 23:42:35,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:35,904 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2018-11-28 23:42:35,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2018-11-28 23:42:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-28 23:42:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 23:42:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2018-11-28 23:42:35,917 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2018-11-28 23:42:35,918 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2018-11-28 23:42:35,918 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:42:35,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2018-11-28 23:42:35,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:35,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:35,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:35,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:35,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:35,924 INFO L794 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1388#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1389#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1413#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1414#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1415#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1433#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1432#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1431#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1430#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1429#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1427#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1425#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1424#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1423#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1422#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1421#L79-3 assume !(main_~i~1 < 8); 1412#L79-4 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); 1380#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1381#L52-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; 1404#L55 assume parse_expression_list_#t~switch4; 1392#L56-5 [2018-11-28 23:42:35,924 INFO L796 eck$LassoCheckResult]: Loop: 1392#L56-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; 1398#L56-1 assume parse_expression_list_#t~short7; 1390#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 1392#L56-5 [2018-11-28 23:42:35,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2018-11-28 23:42:35,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2018-11-28 23:42:35,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:35,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2018-11-28 23:42:35,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:35,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:36,493 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-11-28 23:42:36,765 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-11-28 23:42:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:36,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:36,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:42:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:36,864 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2018-11-28 23:42:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:37,144 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2018-11-28 23:42:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:37,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2018-11-28 23:42:37,148 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:42:37,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2018-11-28 23:42:37,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:37,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:37,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2018-11-28 23:42:37,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:37,152 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2018-11-28 23:42:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2018-11-28 23:42:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2018-11-28 23:42:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 23:42:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2018-11-28 23:42:37,157 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2018-11-28 23:42:37,157 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2018-11-28 23:42:37,158 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:42:37,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2018-11-28 23:42:37,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:37,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:37,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:37,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:37,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:37,164 INFO L794 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1557#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1558#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1584#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1585#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1586#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1605#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1604#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1603#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1602#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1601#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1600#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1598#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1597#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1596#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1595#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1594#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1593#L79-3 assume !(main_~i~1 < 8); 1583#L79-4 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); 1549#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1550#L52-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; 1571#L55 assume !parse_expression_list_#t~switch4; 1563#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1564#L52-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); 1574#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1572#L52-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; 1573#L55 assume parse_expression_list_#t~switch4; 1578#L56-5 [2018-11-28 23:42:37,164 INFO L796 eck$LassoCheckResult]: Loop: 1578#L56-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; 1579#L56-1 assume parse_expression_list_#t~short7; 1609#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 1578#L56-5 [2018-11-28 23:42:37,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2018-11-28 23:42:37,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:37,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2018-11-28 23:42:37,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2018-11-28 23:42:37,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:37,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:37,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:37,578 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-28 23:42:44,810 WARN L180 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 232 DAG size of output: 170 [2018-11-28 23:42:45,113 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-28 23:42:45,115 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:45,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:45,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:45,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:45,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:45,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:45,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:45,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:45,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-28 23:42:45,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:45,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:45,120 INFO 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:45,134 INFO 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:45,136 INFO 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:45,137 INFO 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:45,139 INFO 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:45,140 INFO 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:45,142 INFO 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:45,331 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-11-28 23:42:45,368 INFO 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:45,379 INFO 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:45,381 INFO 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:45,385 INFO 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:45,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,402 INFO 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:45,431 INFO 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:45,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:45,480 INFO 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:45,503 INFO 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:45,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:45,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:45,603 INFO 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:45,630 INFO 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:45,656 INFO 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:45,682 INFO 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:45,698 INFO 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:45,700 INFO 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:46,049 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:46,049 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:46,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:46,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:46,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:46,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:46,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:46,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:46,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:46,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:46,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:46,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:46,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:46,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:46,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:46,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:46,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:46,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:46,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:46,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:46,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:46,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:46,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:46,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:46,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:46,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:46,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:46,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:46,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:46,113 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:46,146 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:42:46,146 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:42:46,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:46,148 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:46,148 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:46,148 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2, ULTIMATE.start_parse_expression_list_~start~0, ULTIMATE.start_parse_expression_list_~str.offset) = 1*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 Supporting invariants [] [2018-11-28 23:42:46,223 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:42:46,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:42:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:46,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:46,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:46,369 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:46,369 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:46,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-28 23:42:46,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 176 states and 237 transitions. Complement of second has 7 states. [2018-11-28 23:42:46,563 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:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:42:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-28 23:42:46,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2018-11-28 23:42:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:46,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 23:42:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:46,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-28 23:42:46,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:46,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2018-11-28 23:42:46,572 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-28 23:42:46,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2018-11-28 23:42:46,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-28 23:42:46,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-28 23:42:46,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2018-11-28 23:42:46,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:46,576 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2018-11-28 23:42:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2018-11-28 23:42:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2018-11-28 23:42:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 23:42:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2018-11-28 23:42:46,586 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2018-11-28 23:42:46,586 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2018-11-28 23:42:46,586 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:42:46,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2018-11-28 23:42:46,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:46,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:46,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:46,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:46,593 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:46,594 INFO L794 eck$LassoCheckResult]: Stem: 1973#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1943#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 1944#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1975#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1976#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1977#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1997#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1996#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1995#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1994#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1993#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1992#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1991#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1990#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1989#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1988#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1987#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1986#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1985#L79-3 assume !(main_~i~1 < 8); 1974#L79-4 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); 1939#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1940#L52-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; 1957#L55 assume parse_expression_list_#t~switch4; 1965#L56-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; 1966#L56-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; 2021#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2015#L56-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); 2019#L57 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; 1980#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1935#L59-8 [2018-11-28 23:42:46,594 INFO L796 eck$LassoCheckResult]: Loop: 1935#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1936#L59-1 assume !parse_expression_list_#t~short14; 1953#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;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; 1935#L59-8 [2018-11-28 23:42:46,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2018-11-28 23:42:46,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:46,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:47,066 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-11-28 23:42:47,517 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 20 [2018-11-28 23:42:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:47,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:47,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:42:47,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:47,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2018-11-28 23:42:47,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:47,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:47,629 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:47,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:47,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:42:47,629 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:42:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:42:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:42:47,630 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2018-11-28 23:42:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:47,644 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2018-11-28 23:42:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:42:47,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2018-11-28 23:42:47,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:47,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2018-11-28 23:42:47,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:47,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:47,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2018-11-28 23:42:47,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:47,649 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2018-11-28 23:42:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2018-11-28 23:42:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-28 23:42:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 23:42:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2018-11-28 23:42:47,655 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2018-11-28 23:42:47,659 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2018-11-28 23:42:47,659 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:42:47,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2018-11-28 23:42:47,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:47,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:47,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:47,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:47,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:47,663 INFO L794 eck$LassoCheckResult]: Stem: 2170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2138#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2139#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2217#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2216#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2215#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2214#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2213#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2212#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2210#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2209#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2208#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2207#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2206#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2205#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2204#L79-3 assume !(main_~i~1 < 8); 2171#L79-4 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); 2130#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2131#L52-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; 2153#L55 assume parse_expression_list_#t~switch4; 2198#L56-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; 2147#L56-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; 2140#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2141#L56-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); 2157#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2175#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2132#L59-8 [2018-11-28 23:42:47,663 INFO L796 eck$LassoCheckResult]: Loop: 2132#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2133#L59-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; 2150#L59-2 assume parse_expression_list_#t~short13; 2177#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2169#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;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; 2132#L59-8 [2018-11-28 23:42:47,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2018-11-28 23:42:47,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:47,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:47,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:47,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2018-11-28 23:42:47,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:47,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:47,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2018-11-28 23:42:47,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:47,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:47,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:42:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:42:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:42:47,887 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-28 23:42:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:48,030 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2018-11-28 23:42:48,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:48,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2018-11-28 23:42:48,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:48,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2018-11-28 23:42:48,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-28 23:42:48,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:42:48,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2018-11-28 23:42:48,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:48,035 INFO L705 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2018-11-28 23:42:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2018-11-28 23:42:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2018-11-28 23:42:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 23:42:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2018-11-28 23:42:48,040 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2018-11-28 23:42:48,041 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2018-11-28 23:42:48,041 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:42:48,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2018-11-28 23:42:48,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:48,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:48,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:48,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:48,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:48,046 INFO L794 eck$LassoCheckResult]: Stem: 2416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2390#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2391#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2418#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2419#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2420#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2454#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2453#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2452#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2451#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2450#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2449#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2448#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2447#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2446#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2445#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2444#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2443#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2442#L79-3 assume !(main_~i~1 < 8); 2417#L79-4 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); 2386#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2387#L52-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; 2405#L55 assume !parse_expression_list_#t~switch4; 2441#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2473#L52-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); 2472#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2464#L52-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; 2461#L55 assume parse_expression_list_#t~switch4; 2458#L56-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; 2457#L56-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; 2392#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2393#L56-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); 2427#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2421#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2382#L59-8 [2018-11-28 23:42:48,046 INFO L796 eck$LassoCheckResult]: Loop: 2382#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2383#L59-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; 2402#L59-2 assume parse_expression_list_#t~short13; 2423#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2415#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;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; 2382#L59-8 [2018-11-28 23:42:48,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2018-11-28 23:42:48,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2018-11-28 23:42:48,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2018-11-28 23:42:48,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:48,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:42:48,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:42:48,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:48,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:48,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:42:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:42:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:48,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:48,390 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2018-11-28 23:42:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:48,560 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2018-11-28 23:42:48,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:42:48,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2018-11-28 23:42:48,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-28 23:42:48,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2018-11-28 23:42:48,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 23:42:48,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-28 23:42:48,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2018-11-28 23:42:48,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:48,567 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2018-11-28 23:42:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2018-11-28 23:42:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2018-11-28 23:42:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-28 23:42:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2018-11-28 23:42:48,571 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2018-11-28 23:42:48,571 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2018-11-28 23:42:48,572 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 23:42:48,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2018-11-28 23:42:48,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:48,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:48,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:48,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:42:48,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:42:48,575 INFO L794 eck$LassoCheckResult]: Stem: 2834#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2808#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 2809#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2836#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2837#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2838#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2848#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2863#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2862#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2861#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2860#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2859#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2857#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2856#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2855#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2854#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2853#L79-3 assume !(main_~i~1 < 8); 2835#L79-4 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); 2800#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2801#L52-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; 2822#L55 assume !parse_expression_list_#t~switch4; 2915#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2919#L52-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); 2918#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2917#L52-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; 2914#L55 assume !parse_expression_list_#t~switch4; 2909#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2931#L52-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); 2930#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2913#L52-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; 2908#L55 assume parse_expression_list_#t~switch4; 2903#L56-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; 2898#L56-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; 2894#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 2892#L56-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); 2888#L57 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; 2841#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2802#L59-8 [2018-11-28 23:42:48,575 INFO L796 eck$LassoCheckResult]: Loop: 2802#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2803#L59-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; 2819#L59-2 assume parse_expression_list_#t~short13; 2844#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2833#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;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; 2802#L59-8 [2018-11-28 23:42:48,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2018-11-28 23:42:48,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:48,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2018-11-28 23:42:48,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:48,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2018-11-28 23:42:48,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:48,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:48,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:48,861 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-28 23:42:56,611 WARN L180 SmtUtils]: Spent 7.73 s on a formula simplification. DAG size of input: 287 DAG size of output: 200 [2018-11-28 23:42:56,911 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-28 23:42:56,916 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:42:56,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:42:56,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:42:56,916 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:42:56,916 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:42:56,916 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:42:56,916 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:42:56,916 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:42:56,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i_Iteration16_Lasso [2018-11-28 23:42:56,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:42:56,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:42:56,923 INFO 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:56,928 INFO 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:56,930 INFO 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:56,932 INFO 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:56,934 INFO 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:56,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:56,938 INFO 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:56,940 INFO 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:56,962 INFO 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:56,983 INFO 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:56,987 INFO 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:56,989 INFO 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:56,991 INFO 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:56,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:56,995 INFO 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:57,017 INFO 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:57,032 INFO 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:57,034 INFO 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:57,036 INFO 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:57,038 INFO 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:57,042 INFO 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:57,048 INFO 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:57,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:57,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:57,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:57,256 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-11-28 23:42:57,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:42:57,295 INFO 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:57,314 INFO 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:57,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:42:57,692 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:42:57,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:42:57,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:42:57,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:42:57,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,753 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:57,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,754 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:57,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,758 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:57,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,759 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:57,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:57,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,763 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:42:57,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:42:57,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:42:57,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:42:57,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:42:57,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:42:57,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:42:57,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:42:57,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:42:57,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:42:57,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:42:57,813 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:42:57,813 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:42:57,813 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:42:57,814 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:42:57,814 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:42:57,814 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:58,048 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:42:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:58,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:58,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:42:58,314 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:58,314 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:58,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2018-11-28 23:42:58,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51. Second operand 4 states. Result 296 states and 391 transitions. Complement of second has 11 states. [2018-11-28 23:42:58,499 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:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:42:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-28 23:42:58,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2018-11-28 23:42:58,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:58,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2018-11-28 23:42:58,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:58,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2018-11-28 23:42:58,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:42:58,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2018-11-28 23:42:58,505 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2018-11-28 23:42:58,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2018-11-28 23:42:58,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-28 23:42:58,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-28 23:42:58,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2018-11-28 23:42:58,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:58,507 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2018-11-28 23:42:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2018-11-28 23:42:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2018-11-28 23:42:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-28 23:42:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2018-11-28 23:42:58,512 INFO L728 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2018-11-28 23:42:58,512 INFO L608 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2018-11-28 23:42:58,512 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 23:42:58,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2018-11-28 23:42:58,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:42:58,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:58,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:58,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1, 1] [2018-11-28 23:42:58,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:58,515 INFO L794 eck$LassoCheckResult]: Stem: 3465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3441#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 3442#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3467#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3468#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3469#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3490#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3489#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3488#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3487#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3486#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3485#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3484#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3483#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3482#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3481#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3480#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3479#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3478#L79-3 assume !(main_~i~1 < 8); 3466#L79-4 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); 3433#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3434#L52-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; 3453#L55 assume parse_expression_list_#t~switch4; 3526#L56-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; 3558#L56-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; 3556#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 3554#L56-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); 3553#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 3551#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3550#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3549#L59-1 assume !parse_expression_list_#t~short14; 3548#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13; 3547#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3546#L60 assume !parse_expression_list_#t~short17; 3545#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 3544#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3543#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);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; 3542#L31 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; 3541#L4 assume !(0 == __VERIFIER_assert_~cond); 3540#L4-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); 3539#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3538#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3537#L52-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); 3536#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3535#L52-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; 3534#L55 assume parse_expression_list_#t~switch4; 3444#L56-5 [2018-11-28 23:42:58,515 INFO L796 eck$LassoCheckResult]: Loop: 3444#L56-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; 3449#L56-1 assume parse_expression_list_#t~short7; 3443#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 3444#L56-5 [2018-11-28 23:42:58,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2018-11-28 23:42:58,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:58,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:58,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:58,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:42:58,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:58,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:42:58,684 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:58,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2018-11-28 23:42:58,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:42:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:42:58,803 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 7 states. [2018-11-28 23:42:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:58,984 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-11-28 23:42:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:42:58,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 159 transitions. [2018-11-28 23:42:58,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:58,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 107 states and 139 transitions. [2018-11-28 23:42:58,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:42:58,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:42:58,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2018-11-28 23:42:58,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:58,990 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2018-11-28 23:42:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2018-11-28 23:42:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-28 23:42:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 23:42:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2018-11-28 23:42:58,997 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2018-11-28 23:42:58,997 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2018-11-28 23:42:58,997 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 23:42:58,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2018-11-28 23:42:58,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:58,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:58,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:58,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1, 1] [2018-11-28 23:42:58,999 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:58,999 INFO L794 eck$LassoCheckResult]: Stem: 3750#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3724#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 3725#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3752#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3753#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3754#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3761#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3784#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3782#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3779#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3776#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3775#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3774#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3773#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3771#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3769#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3767#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3764#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3763#L79-3 assume !(main_~i~1 < 8); 3751#L79-4 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); 3716#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3717#L52-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; 3737#L55 assume !parse_expression_list_#t~switch4; 3731#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3732#L52-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); 3740#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3738#L52-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; 3739#L55 assume parse_expression_list_#t~switch4; 3745#L56-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; 3746#L56-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; 3817#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 3818#L56-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); 3816#L57 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; 3756#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3720#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3721#L59-1 assume !parse_expression_list_#t~short14; 3736#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13; 3749#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3781#L60 assume !parse_expression_list_#t~short17; 3778#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 3713#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3722#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);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; 3723#L31 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; 3747#L4 assume !(0 == __VERIFIER_assert_~cond); 3760#L4-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); 3743#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3744#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 3772#L52-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); 3770#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3768#L52-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; 3765#L55 assume parse_expression_list_#t~switch4; 3728#L56-5 [2018-11-28 23:42:59,000 INFO L796 eck$LassoCheckResult]: Loop: 3728#L56-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; 3733#L56-1 assume parse_expression_list_#t~short7; 3726#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 3728#L56-5 [2018-11-28 23:42:59,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash -70433790, now seen corresponding path program 1 times [2018-11-28 23:42:59,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:59,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:42:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-28 23:42:59,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:42:59,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 23:42:59,181 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:42:59,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2018-11-28 23:42:59,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:42:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:42:59,368 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-28 23:42:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:42:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:42:59,381 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 9 states. [2018-11-28 23:42:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:42:59,764 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2018-11-28 23:42:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:42:59,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 240 transitions. [2018-11-28 23:42:59,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 23:42:59,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 159 states and 209 transitions. [2018-11-28 23:42:59,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:42:59,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-28 23:42:59,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 209 transitions. [2018-11-28 23:42:59,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:42:59,770 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 209 transitions. [2018-11-28 23:42:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 209 transitions. [2018-11-28 23:42:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2018-11-28 23:42:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 23:42:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2018-11-28 23:42:59,774 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2018-11-28 23:42:59,774 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 165 transitions. [2018-11-28 23:42:59,774 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 23:42:59,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 165 transitions. [2018-11-28 23:42:59,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:42:59,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:42:59,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:42:59,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 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, 1, 1, 1] [2018-11-28 23:42:59,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:42:59,776 INFO L794 eck$LassoCheckResult]: Stem: 4065#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4038#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc(9);main_~i~1 := 0; 4039#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4067#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4068#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4069#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4089#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4088#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4087#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4086#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4085#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4084#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4083#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4082#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4081#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4080#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4079#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4078#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4077#L79-3 assume !(main_~i~1 < 8); 4066#L79-4 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); 4030#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4031#L52-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; 4051#L55 assume !parse_expression_list_#t~switch4; 4119#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4118#L52-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); 4117#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4052#L52-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; 4053#L55 assume parse_expression_list_#t~switch4; 4060#L56-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; 4048#L56-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; 4043#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5; 4044#L56-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); 4057#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 4071#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4034#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 4035#L59-1 assume !parse_expression_list_#t~short14; 4050#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13; 4098#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4097#L60 assume !parse_expression_list_#t~short17; 4096#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16; 4026#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4036#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);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; 4037#L31 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; 4061#L4 assume !(0 == __VERIFIER_assert_~cond); 4075#L4-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); 4058#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4059#L54 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 4094#L52-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); 4093#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4092#L52-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; 4090#L55 assume parse_expression_list_#t~switch4; 4042#L56-5 [2018-11-28 23:42:59,777 INFO L796 eck$LassoCheckResult]: Loop: 4042#L56-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; 4047#L56-1 assume parse_expression_list_#t~short7; 4040#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;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; 4042#L56-5 [2018-11-28 23:42:59,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:42:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2018-11-28 23:42:59,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:42:59,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:42:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:42:59,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:42:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:43:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 23:43:00,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:43:00,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:43:00,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:43:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:43:00,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:43:00,069 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 6 treesize of output 5 [2018-11-28 23:43:00,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 23:43:00,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:43:00,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:43:00,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:43:00,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-28 23:43:00,186 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:43:00,189 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:43:00,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,204 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:43:00,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2018-11-28 23:43:00,298 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:43:00,301 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:43:00,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,316 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:43:00,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 23:43:00,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:43:00,329 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:43:00,330 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2018-11-28 23:43:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 23:43:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:43:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-28 23:43:00,383 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:43:00,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:43:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2018-11-28 23:43:00,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:43:00,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:43:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:43:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:43:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:43:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:43:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:43:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:43:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:43:00,499 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. cyclomatic complexity: 47 Second operand 11 states. [2018-11-28 23:43:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:43:01,127 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2018-11-28 23:43:01,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:43:01,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 112 transitions. [2018-11-28 23:43:01,129 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:43:01,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 0 states and 0 transitions. [2018-11-28 23:43:01,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:43:01,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:43:01,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:43:01,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:43:01,130 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:43:01,130 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:43:01,130 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:43:01,130 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 23:43:01,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:43:01,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:43:01,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:43:01,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:43:01 BoogieIcfgContainer [2018-11-28 23:43:01,148 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:43:01,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:43:01,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:43:01,149 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:43:01,152 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:23" (3/4) ... [2018-11-28 23:43:01,167 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:43:01,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:43:01,172 INFO L168 Benchmark]: Toolchain (without parser) took 38760.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -233.2 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:43:01,173 INFO L168 Benchmark]: CDTParser took 0.21 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:43:01,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.59 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:43:01,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:43:01,178 INFO L168 Benchmark]: Boogie Preprocessor took 31.45 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:43:01,178 INFO L168 Benchmark]: RCFGBuilder took 652.38 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:43:01,184 INFO L168 Benchmark]: BuchiAutomizer took 37542.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:43:01,185 INFO L168 Benchmark]: Witness Printer took 22.34 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:43:01,197 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.21 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 387.59 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -203.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.45 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 652.38 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37542.13 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.6 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. * Witness Printer took 22.34 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 * unknown-#length-unknown[A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * start + -1 * str and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 15 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.4s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 33.2s. Construction of modules took 1.7s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 236 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 142 states and ocurred in iteration 16. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 694 SDtfs, 889 SDslu, 1858 SDs, 0 SdLazy, 829 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU11 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf100 lsp92 ukn55 mio100 lsp49 div100 bol100 ite100 ukn100 eq180 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...