./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f5357e64289d6bac41f74df7b40a85eebbaa806 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:00:31,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:00:31,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:00:31,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:00:31,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:00:31,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:00:31,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:00:31,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:00:31,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:00:31,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:00:31,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:00:31,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:00:31,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:00:31,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:00:31,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:00:31,828 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:00:31,829 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:00:31,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:00:31,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:00:31,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:00:31,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:00:31,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:00:31,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:00:31,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:00:31,840 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:00:31,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:00:31,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:00:31,843 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:00:31,844 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:00:31,845 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:00:31,845 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:00:31,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:00:31,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:00:31,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:00:31,848 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:00:31,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:00:31,849 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:00:31,874 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:00:31,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:00:31,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:00:31,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:00:31,876 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:00:31,877 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:00:31,881 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:00:31,881 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:00:31,881 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:00:31,881 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:00:31,882 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:00:31,882 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:00:31,882 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:00:31,882 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:00:31,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:00:31,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:00:31,884 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:00:31,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:00:31,885 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:00:31,885 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:00:31,886 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:00:31,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:00:31,886 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:00:31,886 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:00:31,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:00:31,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:00:31,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:00:31,887 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:00:31,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:00:31,887 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:00:31,887 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:00:31,891 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:00:31,892 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f5357e64289d6bac41f74df7b40a85eebbaa806 [2019-01-01 23:00:31,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:00:31,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:00:31,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:00:31,981 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:00:31,982 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:00:31,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-01 23:00:32,040 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b03e3a53/b39836fe13c340ab9835fa217281f7ab/FLAG9769a3033 [2019-01-01 23:00:32,470 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:00:32,471 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-01 23:00:32,479 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b03e3a53/b39836fe13c340ab9835fa217281f7ab/FLAG9769a3033 [2019-01-01 23:00:32,830 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b03e3a53/b39836fe13c340ab9835fa217281f7ab [2019-01-01 23:00:32,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:00:32,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:00:32,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:00:32,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:00:32,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:00:32,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:00:32" (1/1) ... [2019-01-01 23:00:32,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51539641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:32, skipping insertion in model container [2019-01-01 23:00:32,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:00:32" (1/1) ... [2019-01-01 23:00:32,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:00:32,890 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:00:33,147 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:00:33,166 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:00:33,235 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:00:33,271 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:00:33,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33 WrapperNode [2019-01-01 23:00:33,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:00:33,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:00:33,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:00:33,274 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:00:33,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:00:33,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:00:33,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:00:33,344 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:00:33,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (1/1) ... [2019-01-01 23:00:33,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:00:33,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:00:33,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:00:33,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:00:33,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (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 [2019-01-01 23:00:33,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:00:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 23:00:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 23:00:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-01-01 23:00:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:00:33,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:00:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 23:00:34,161 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:00:34,161 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-01 23:00:34,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:34 BoogieIcfgContainer [2019-01-01 23:00:34,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:00:34,163 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:00:34,163 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:00:34,168 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:00:34,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:34,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:00:32" (1/3) ... [2019-01-01 23:00:34,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@586c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:00:34, skipping insertion in model container [2019-01-01 23:00:34,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:34,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:00:33" (2/3) ... [2019-01-01 23:00:34,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@586c55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:00:34, skipping insertion in model container [2019-01-01 23:00:34,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:00:34,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:34" (3/3) ... [2019-01-01 23:00:34,175 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2019-01-01 23:00:34,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:00:34,241 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:00:34,241 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:00:34,241 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:00:34,242 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:00:34,242 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:00:34,242 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:00:34,242 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:00:34,242 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:00:34,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-01 23:00:34,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:34,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:34,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:34,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:00:34,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:34,298 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:00:34,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-01-01 23:00:34,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-01 23:00:34,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:34,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:34,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:00:34,303 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:34,314 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 25#L50true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L51-4true [2019-01-01 23:00:34,314 INFO L796 eck$LassoCheckResult]: Loop: 3#L51-4true parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 11#L54true assume !parse_expression_list_#t~switch4; 29#L53true havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 8#L51-1true call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L51-2true assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3#L51-4true [2019-01-01 23:00:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 23:00:34,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:34,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:34,498 INFO L82 PathProgramCache]: Analyzing trace with hash 41899121, now seen corresponding path program 1 times [2019-01-01 23:00:34,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:34,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:34,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash 181226926, now seen corresponding path program 1 times [2019-01-01 23:00:34,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:34,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:34,859 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 23:00:35,030 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 23:00:35,353 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-01-01 23:00:35,489 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-01 23:00:35,517 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:35,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:35,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:35,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:35,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:35,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:35,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:35,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:35,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 23:00:35,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:35,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:35,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,228 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-01-01 23:00:36,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:36,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:37,082 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:37,173 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:37,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:37,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:37,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:37,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,307 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:00:37,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,310 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:00:37,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:37,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,336 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 23:00:37,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,345 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:00:37,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:37,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:37,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:37,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:37,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:37,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:37,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:37,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:37,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:37,565 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:00:37,565 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:00:37,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:37,572 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:37,575 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:37,576 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 [] [2019-01-01 23:00:37,730 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-01 23:00:37,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:00:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:38,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:38,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:38,185 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 [2019-01-01 23:00:38,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-01-01 23:00:38,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 99 states and 138 transitions. Complement of second has 5 states. [2019-01-01 23:00:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 23:00:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2019-01-01 23:00:38,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 5 letters. [2019-01-01 23:00:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 23:00:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:38,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-01 23:00:38,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:38,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 138 transitions. [2019-01-01 23:00:38,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:38,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 40 states and 55 transitions. [2019-01-01 23:00:38,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 23:00:38,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 23:00:38,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2019-01-01 23:00:38,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:38,360 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2019-01-01 23:00:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2019-01-01 23:00:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-01-01 23:00:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 23:00:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-01-01 23:00:38,393 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-01-01 23:00:38,393 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-01-01 23:00:38,393 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:00:38,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2019-01-01 23:00:38,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:38,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:38,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:38,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:38,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:38,397 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 221#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 222#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 204#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 205#L54 assume parse_expression_list_#t~switch4; 214#L55-5 [2019-01-01 23:00:38,397 INFO L796 eck$LassoCheckResult]: Loop: 214#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 215#L55-1 assume parse_expression_list_#t~short7; 219#L55-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; 214#L55-5 [2019-01-01 23:00:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2019-01-01 23:00:38,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:38,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2019-01-01 23:00:38,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:38,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2019-01-01 23:00:38,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:38,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:38,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:38,833 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-01 23:00:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:39,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:00:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:00:39,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:00:39,102 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-01 23:00:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:39,335 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-01-01 23:00:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:00:39,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2019-01-01 23:00:39,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 23:00:39,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2019-01-01 23:00:39,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:00:39,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 23:00:39,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2019-01-01 23:00:39,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:39,343 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-01-01 23:00:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2019-01-01 23:00:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-01-01 23:00:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 23:00:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-01-01 23:00:39,351 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-01-01 23:00:39,351 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-01-01 23:00:39,351 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:00:39,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2019-01-01 23:00:39,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:39,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:39,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:39,355 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:39,355 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:39,355 INFO L794 eck$LassoCheckResult]: Stem: 366#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 345#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 346#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 327#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 328#L54 assume !parse_expression_list_#t~switch4; 337#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 342#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 331#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 329#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 330#L54 assume parse_expression_list_#t~switch4; 338#L55-5 [2019-01-01 23:00:39,355 INFO L796 eck$LassoCheckResult]: Loop: 338#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 339#L55-1 assume parse_expression_list_#t~short7; 372#L55-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; 338#L55-5 [2019-01-01 23:00:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1934582895, now seen corresponding path program 1 times [2019-01-01 23:00:39,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,419 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2019-01-01 23:00:39,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:39,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1007139050, now seen corresponding path program 1 times [2019-01-01 23:00:39,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:39,805 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:40,214 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-01-01 23:00:40,484 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-01 23:00:40,487 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:40,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:40,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:40,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:40,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:40,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:40,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:40,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:40,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-01 23:00:40,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:40,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:40,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:40,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,126 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-01-01 23:00:41,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:41,960 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:41,987 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:41,987 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:41,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:41,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:41,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:41,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:41,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:41,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:41,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:41,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:41,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:41,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:41,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:41,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:41,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:41,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:41,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:41,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:41,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:42,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:42,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:42,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,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 [2019-01-01 23:00:42,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:42,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:42,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:42,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:42,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:42,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:42,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:42,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:42,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:42,163 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 23:00:42,163 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 23:00:42,163 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:42,166 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:42,166 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:42,166 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 [] [2019-01-01 23:00:42,280 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-01 23:00:42,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 23:00:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:42,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:42,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:42,343 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 [2019-01-01 23:00:42,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-01 23:00:42,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 153 states and 213 transitions. Complement of second has 7 states. [2019-01-01 23:00:42,539 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 [2019-01-01 23:00:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 23:00:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2019-01-01 23:00:42,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-01 23:00:42,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:42,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 23:00:42,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:42,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 23:00:42,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:42,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2019-01-01 23:00:42,544 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-01-01 23:00:42,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2019-01-01 23:00:42,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 23:00:42,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-01-01 23:00:42,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2019-01-01 23:00:42,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:42,549 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2019-01-01 23:00:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2019-01-01 23:00:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2019-01-01 23:00:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-01 23:00:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2019-01-01 23:00:42,557 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-01-01 23:00:42,557 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2019-01-01 23:00:42,557 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:00:42,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2019-01-01 23:00:42,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:42,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:42,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:42,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:42,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:42,567 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 646#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 647#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 625#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 626#L54 assume parse_expression_list_#t~switch4; 654#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 695#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 693#L55-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; 645#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 690#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 655#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 656#L58-8 [2019-01-01 23:00:42,567 INFO L796 eck$LassoCheckResult]: Loop: 656#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 663#L58-1 assume !parse_expression_list_#t~short14; 649#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 656#L58-8 [2019-01-01 23:00:42,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2019-01-01 23:00:42,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:42,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:42,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:42,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:00:42,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2019-01-01 23:00:42,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:42,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:42,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:42,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:42,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 23:00:42,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:00:42,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:00:42,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:00:42,986 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2019-01-01 23:00:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:42,998 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-01-01 23:00:43,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:00:43,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-01-01 23:00:43,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:43,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2019-01-01 23:00:43,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-01-01 23:00:43,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-01-01 23:00:43,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2019-01-01 23:00:43,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:43,006 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-01-01 23:00:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2019-01-01 23:00:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-01 23:00:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 23:00:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-01-01 23:00:43,013 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-01-01 23:00:43,013 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-01-01 23:00:43,013 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:00:43,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2019-01-01 23:00:43,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:43,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:43,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:43,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:43,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:43,016 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 802#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 803#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 782#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 783#L54 assume parse_expression_list_#t~switch4; 794#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 795#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 800#L55-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; 787#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 788#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 806#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 807#L58-8 [2019-01-01 23:00:43,017 INFO L796 eck$LassoCheckResult]: Loop: 807#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 819#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 816#L58-2 assume parse_expression_list_#t~short13; 810#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 811#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 807#L58-8 [2019-01-01 23:00:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2019-01-01 23:00:43,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:43,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:43,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:43,416 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-01 23:00:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:43,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:43,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:00:43,680 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:43,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,681 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2019-01-01 23:00:43,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:43,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:43,773 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-01-01 23:00:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:43,980 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-01-01 23:00:43,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:43,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2019-01-01 23:00:43,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 23:00:43,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2019-01-01 23:00:43,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 23:00:43,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 23:00:43,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2019-01-01 23:00:43,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:43,986 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2019-01-01 23:00:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2019-01-01 23:00:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2019-01-01 23:00:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 23:00:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2019-01-01 23:00:43,993 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2019-01-01 23:00:43,993 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2019-01-01 23:00:43,993 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:00:43,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2019-01-01 23:00:43,994 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:43,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:43,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:43,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:43,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:43,998 INFO L794 eck$LassoCheckResult]: Stem: 1017#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 992#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 993#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 972#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 973#L54 assume parse_expression_list_#t~switch4; 984#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 985#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 990#L55-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; 978#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 979#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 997#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 998#L58-8 [2019-01-01 23:00:43,999 INFO L796 eck$LassoCheckResult]: Loop: 998#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1009#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1006#L58-2 assume parse_expression_list_#t~short13; 1001#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1002#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 998#L58-8 [2019-01-01 23:00:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:43,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2019-01-01 23:00:43,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:43,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:44,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2019-01-01 23:00:44,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2019-01-01 23:00:44,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:44,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:44,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:00:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:00:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:00:44,221 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand 6 states. [2019-01-01 23:00:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:44,329 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-01-01 23:00:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:44,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2019-01-01 23:00:44,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:44,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2019-01-01 23:00:44,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 23:00:44,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 23:00:44,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2019-01-01 23:00:44,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:44,337 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2019-01-01 23:00:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2019-01-01 23:00:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2019-01-01 23:00:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-01 23:00:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2019-01-01 23:00:44,343 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2019-01-01 23:00:44,344 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2019-01-01 23:00:44,344 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:00:44,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2019-01-01 23:00:44,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:44,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:44,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:44,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:44,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:44,348 INFO L794 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1193#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1194#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1173#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1174#L54 assume !parse_expression_list_#t~switch4; 1196#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1237#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1236#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1235#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1195#L54 assume parse_expression_list_#t~switch4; 1197#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1187#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1191#L55-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; 1192#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1244#L56 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1199#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1200#L58-8 [2019-01-01 23:00:44,351 INFO L796 eck$LassoCheckResult]: Loop: 1200#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1212#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1209#L58-2 assume parse_expression_list_#t~short13; 1203#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1204#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 1200#L58-8 [2019-01-01 23:00:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -960269984, now seen corresponding path program 1 times [2019-01-01 23:00:44,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:44,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2019-01-01 23:00:44,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1965798457, now seen corresponding path program 1 times [2019-01-01 23:00:44,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:44,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:44,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:44,511 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 [2019-01-01 23:00:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:44,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:44,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 23:00:44,849 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-01-01 23:00:44,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:00:44,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:00:44,869 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand 7 states. [2019-01-01 23:00:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:45,456 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2019-01-01 23:00:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:00:45,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2019-01-01 23:00:45,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-01 23:00:45,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2019-01-01 23:00:45,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-01-01 23:00:45,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2019-01-01 23:00:45,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2019-01-01 23:00:45,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:45,463 INFO L705 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2019-01-01 23:00:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2019-01-01 23:00:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2019-01-01 23:00:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 23:00:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-01-01 23:00:45,474 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-01-01 23:00:45,474 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-01-01 23:00:45,474 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:00:45,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2019-01-01 23:00:45,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:45,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:45,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:45,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:45,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:00:45,483 INFO L794 eck$LassoCheckResult]: Stem: 1531#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1507#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1508#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1489#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1490#L54 assume !parse_expression_list_#t~switch4; 1584#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1583#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1582#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1581#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1578#L54 assume !parse_expression_list_#t~switch4; 1544#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 1600#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1549#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1548#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1543#L54 assume parse_expression_list_#t~switch4; 1545#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1593#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 1592#L55-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; 1494#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1495#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 1510#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1511#L58-8 [2019-01-01 23:00:45,483 INFO L796 eck$LassoCheckResult]: Loop: 1511#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1524#L58-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 1521#L58-2 assume parse_expression_list_#t~short13; 1514#L58-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 1515#L58-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;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; 1511#L58-8 [2019-01-01 23:00:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2047416532, now seen corresponding path program 1 times [2019-01-01 23:00:45,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:45,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:45,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:45,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2019-01-01 23:00:45,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1001876155, now seen corresponding path program 1 times [2019-01-01 23:00:45,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:45,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:46,440 WARN L181 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-01-01 23:00:47,013 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 121 [2019-01-01 23:00:47,201 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 23:00:47,211 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:00:47,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:00:47,211 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:00:47,211 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:00:47,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:00:47,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:00:47,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:00:47,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:00:47,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration8_Lasso [2019-01-01 23:00:47,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:00:47,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:00:47,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,776 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-01-01 23:00:47,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:47,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:00:48,226 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-01-01 23:00:48,378 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-01-01 23:00:48,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:00:48,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:00:48,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:00:48,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:00:48,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:00:48,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,560 INFO L205 nArgumentSynthesizer]: 5 stem disjuncts [2019-01-01 23:00:48,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,561 INFO L402 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-01-01 23:00:48,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,577 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 23:00:48,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,579 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 23:00:48,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,610 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 23:00:48,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 23:00:48,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:00:48,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:00:48,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:00:48,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:00:48,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:00:48,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:00:48,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 23:00:48,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 23:00:48,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:00:48,668 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:00:48,668 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 23:00:48,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:00:48,669 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 23:00:48,669 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:00:48,670 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 [] [2019-01-01 23:00:49,135 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-01-01 23:00:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:49,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:49,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:49,287 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 [2019-01-01 23:00:49,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-01-01 23:00:49,439 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 267 states and 360 transitions. Complement of second has 11 states. [2019-01-01 23:00:49,442 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 [2019-01-01 23:00:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:00:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-01-01 23:00:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2019-01-01 23:00:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2019-01-01 23:00:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:49,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2019-01-01 23:00:49,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:00:49,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2019-01-01 23:00:49,449 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-01-01 23:00:49,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2019-01-01 23:00:49,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 23:00:49,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 23:00:49,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2019-01-01 23:00:49,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:49,454 INFO L705 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2019-01-01 23:00:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2019-01-01 23:00:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2019-01-01 23:00:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 23:00:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2019-01-01 23:00:49,460 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2019-01-01 23:00:49,460 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2019-01-01 23:00:49,460 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:00:49,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2019-01-01 23:00:49,461 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 23:00:49,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:49,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:49,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:49,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:49,463 INFO L794 eck$LassoCheckResult]: Stem: 2090#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2062#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2063#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2042#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2043#L54 assume parse_expression_list_#t~switch4; 2118#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2117#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2116#L55-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; 2115#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2114#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2113#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2112#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2111#L58-1 assume !parse_expression_list_#t~short14; 2110#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 2109#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2108#L59 assume !parse_expression_list_#t~short17; 2107#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2106#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2105#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2104#L3 assume !(0 == __VERIFIER_assert_~cond); 2103#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2102#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2101#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2100#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2099#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2098#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2096#L54 assume parse_expression_list_#t~switch4; 2059#L55-5 [2019-01-01 23:00:49,463 INFO L796 eck$LassoCheckResult]: Loop: 2059#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2095#L55-1 assume parse_expression_list_#t~short7; 2058#L55-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; 2059#L55-5 [2019-01-01 23:00:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1291887901, now seen corresponding path program 1 times [2019-01-01 23:00:49,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:49,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:00:49,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:00:49,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 23:00:49,800 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:49,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:49,800 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2019-01-01 23:00:49,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:49,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:49,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:49,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:49,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:50,266 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:50,383 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 23:00:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:00:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:00:50,384 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-01-01 23:00:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:50,550 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-01-01 23:00:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:00:50,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2019-01-01 23:00:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:50,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 92 states and 123 transitions. [2019-01-01 23:00:50,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 23:00:50,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 23:00:50,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 123 transitions. [2019-01-01 23:00:50,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:00:50,557 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 123 transitions. [2019-01-01 23:00:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 123 transitions. [2019-01-01 23:00:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-01-01 23:00:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-01 23:00:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2019-01-01 23:00:50,564 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2019-01-01 23:00:50,564 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2019-01-01 23:00:50,564 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:00:50,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2019-01-01 23:00:50,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 23:00:50,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:00:50,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:00:50,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:00:50,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:00:50,570 INFO L794 eck$LassoCheckResult]: Stem: 2323#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2299#L-1 havoc main_#res;havoc main_#t~ret20, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2300#L50 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2280#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2281#L54 assume !parse_expression_list_#t~switch4; 2301#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2367#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2366#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2282#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2283#L54 assume parse_expression_list_#t~switch4; 2364#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2362#L55-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2360#L55-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; 2359#L55-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2358#L56 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2356#L56-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2355#L58-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2315#L58-1 assume !parse_expression_list_#t~short14; 2316#L58-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 2329#L58-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2328#L59 assume !parse_expression_list_#t~short17; 2326#L59-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 2324#L59-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 2321#L30 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2313#L3 assume !(0 == __VERIFIER_assert_~cond); 2310#L3-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2290#L60 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2291#L53 havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; 2292#L51-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2284#L51-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2285#L51-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2327#L54 assume parse_expression_list_#t~switch4; 2293#L55-5 [2019-01-01 23:00:50,570 INFO L796 eck$LassoCheckResult]: Loop: 2293#L55-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2294#L55-1 assume parse_expression_list_#t~short7; 2297#L55-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; 2293#L55-5 [2019-01-01 23:00:50,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash -822771673, now seen corresponding path program 1 times [2019-01-01 23:00:50,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:50,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:00:50,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:50,818 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-01 23:00:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:00:50,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:00:50,901 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 [2019-01-01 23:00:50,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:00:50,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:00:50,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 23:00:50,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:50,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:50,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-01-01 23:00:51,182 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 [2019-01-01 23:00:51,186 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 [2019-01-01 23:00:51,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,219 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. [2019-01-01 23:00:51,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:33 [2019-01-01 23:00:51,326 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 [2019-01-01 23:00:51,332 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 [2019-01-01 23:00:51,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2019-01-01 23:00:51,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 23:00:51,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:42, output treesize:3 [2019-01-01 23:00:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:00:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:00:51,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-01 23:00:51,398 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:00:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:00:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2019-01-01 23:00:51,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:00:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:00:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:00:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:00:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:00:51,562 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-01 23:00:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 23:00:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-01 23:00:51,577 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand 16 states. [2019-01-01 23:00:52,095 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-01-01 23:00:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:00:52,431 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2019-01-01 23:00:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 23:00:52,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2019-01-01 23:00:52,434 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:52,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2019-01-01 23:00:52,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:00:52,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:00:52,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:00:52,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:00:52,435 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:52,435 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:52,435 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:00:52,435 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:00:52,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:00:52,435 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:00:52,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:00:52,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:00:52 BoogieIcfgContainer [2019-01-01 23:00:52,443 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:00:52,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:00:52,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:00:52,444 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:00:52,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:00:34" (3/4) ... [2019-01-01 23:00:52,448 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:00:52,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:00:52,449 INFO L168 Benchmark]: Toolchain (without parser) took 19614.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,450 INFO L168 Benchmark]: CDTParser took 0.35 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. [2019-01-01 23:00:52,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,452 INFO L168 Benchmark]: Boogie Preprocessor took 110.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 935.2 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,453 INFO L168 Benchmark]: RCFGBuilder took 707.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,454 INFO L168 Benchmark]: BuchiAutomizer took 18280.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -149.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:00:52,454 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:00:52,459 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.35 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 435.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 935.2 MB in the beginning and 1.0 GB in the end (delta: -106.2 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 707.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18280.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -149.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 4 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. 7 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.2s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 14.5s. Construction of modules took 1.3s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 221 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 312 SDtfs, 617 SDslu, 658 SDs, 0 SdLazy, 647 SolverSat, 100 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital164 mio100 ax100 hnf101 lsp91 ukn75 mio100 lsp41 div100 bol100 ite100 ukn100 eq183 hnf86 smp96 dnf260 smp72 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 5 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 14 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...