./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49da897df5dcdfc1bc615bb8c40422792fce477f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:00:33,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:00:33,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:00:33,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:00:33,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:00:33,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:00:33,896 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:00:33,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:00:33,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:00:33,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:00:33,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:00:33,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:00:33,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:00:33,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:00:33,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:00:33,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:00:33,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:00:33,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:00:33,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:00:33,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:00:33,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:00:33,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:00:33,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:00:33,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:00:33,910 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:00:33,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:00:33,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:00:33,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:00:33,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:00:33,913 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:00:33,913 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:00:33,914 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:00:33,914 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:00:33,914 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:00:33,915 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:00:33,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:00:33,915 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:00:33,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:00:33,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:00:33,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:00:33,926 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:00:33,926 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:00:33,927 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:00:33,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:00:33,928 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:00:33,928 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:00:33,929 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:00:33,929 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:00:33,929 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:00:33,929 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:00:33,929 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:00:33,930 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:00:33,930 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 49da897df5dcdfc1bc615bb8c40422792fce477f [2018-11-10 10:00:33,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:00:33,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:00:33,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:00:33,962 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:00:33,962 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:00:33,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/../../sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-10 10:00:33,998 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/data/0a9ee30bd/8edaeaed8d574375bdb843c9e51270dd/FLAGd3cd26500 [2018-11-10 10:00:34,419 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:00:34,419 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/sv-benchmarks/c/loops/verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-10 10:00:34,424 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/data/0a9ee30bd/8edaeaed8d574375bdb843c9e51270dd/FLAGd3cd26500 [2018-11-10 10:00:34,436 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/data/0a9ee30bd/8edaeaed8d574375bdb843c9e51270dd [2018-11-10 10:00:34,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:00:34,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:00:34,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:00:34,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:00:34,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:00:34,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c04b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34, skipping insertion in model container [2018-11-10 10:00:34,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:00:34,464 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:00:34,576 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:00:34,582 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:00:34,602 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:00:34,614 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:00:34,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34 WrapperNode [2018-11-10 10:00:34,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:00:34,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:00:34,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:00:34,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:00:34,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:00:34,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:00:34,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:00:34,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:00:34,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... [2018-11-10 10:00:34,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:00:34,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:00:34,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:00:34,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:00:34,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:00:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:00:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:00:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:00:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:00:35,000 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:00:35,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:00:35 BoogieIcfgContainer [2018-11-10 10:00:35,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:00:35,001 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:00:35,001 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:00:35,004 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:00:35,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:00:35,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:00:34" (1/3) ... [2018-11-10 10:00:35,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657a46c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:00:35, skipping insertion in model container [2018-11-10 10:00:35,006 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:00:35,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:00:34" (2/3) ... [2018-11-10 10:00:35,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@657a46c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:00:35, skipping insertion in model container [2018-11-10 10:00:35,007 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:00:35,007 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:00:35" (3/3) ... [2018-11-10 10:00:35,008 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i [2018-11-10 10:00:35,055 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:00:35,055 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:00:35,055 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:00:35,055 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:00:35,055 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:00:35,055 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:00:35,055 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:00:35,055 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:00:35,056 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:00:35,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2018-11-10 10:00:35,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 10:00:35,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:35,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:35,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:35,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:35,089 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:00:35,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2018-11-10 10:00:35,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 10:00:35,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:35,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:35,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:35,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:35,098 INFO L793 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 20#L76true SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 16#L76-1true assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 10#L51true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 32#L52-3true [2018-11-10 10:00:35,098 INFO L795 eck$LassoCheckResult]: Loop: 32#L52-3true assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 17#L54true SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 14#L54-1true parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 42#L55true assume !parse_expression_list_#t~switch3; 37#L54-2true havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 35#L52-1true SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 31#L70true assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 32#L52-3true [2018-11-10 10:00:35,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28691749, now seen corresponding path program 1 times [2018-11-10 10:00:35,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:35,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:35,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash 813659444, now seen corresponding path program 1 times [2018-11-10 10:00:35,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:35,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1245489264, now seen corresponding path program 1 times [2018-11-10 10:00:35,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:35,507 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-11-10 10:00:35,570 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:00:35,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:00:35,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:00:35,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:00:35,572 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:00:35,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:00:35,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:00:35,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:00:35,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 10:00:35,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:00:35,573 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:00:35,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:35,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:36,042 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:00:36,047 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:00:36,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:36,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:36,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:36,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,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 [2018-11-10 10:00:36,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:36,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:36,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:36,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,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 [2018-11-10 10:00:36,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,099 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:36,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,100 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:36,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:36,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:00:36,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:00:36,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:36,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:36,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:36,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:36,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,128 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:36,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:36,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:36,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:36,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:36,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:36,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:36,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:36,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:36,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:36,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:00:36,210 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 10:00:36,210 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-11-10 10:00:36,212 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:00:36,214 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:00:36,214 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:00:36,215 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2018-11-10 10:00:36,228 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-10 10:00:36,234 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:00:36,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:36,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:36,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:36,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 10:00:36,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states. Second operand 4 states. [2018-11-10 10:00:36,410 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states.. Second operand 4 states. Result 139 states and 178 transitions. Complement of second has 7 states. [2018-11-10 10:00:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:00:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:00:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-10 10:00:36,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 5 letters. Loop has 7 letters. [2018-11-10 10:00:36,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:36,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 12 letters. Loop has 7 letters. [2018-11-10 10:00:36,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:36,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 125 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-10 10:00:36,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:36,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 178 transitions. [2018-11-10 10:00:36,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:36,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 64 states and 79 transitions. [2018-11-10 10:00:36,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 10:00:36,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-10 10:00:36,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2018-11-10 10:00:36,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:36,424 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-10 10:00:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2018-11-10 10:00:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-10 10:00:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 10:00:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-10 10:00:36,442 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-10 10:00:36,442 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-10 10:00:36,442 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:00:36,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 79 transitions. [2018-11-10 10:00:36,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:36,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:36,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:36,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:36,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:36,444 INFO L793 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 293#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 303#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 286#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 287#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 304#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 294#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 296#L55 assume parse_expression_list_#t~switch3; 313#L56-9 [2018-11-10 10:00:36,444 INFO L795 eck$LassoCheckResult]: Loop: 313#L56-9 assume true; 309#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 305#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 297#L56-3 assume parse_expression_list_#t~short6; 298#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 313#L56-9 [2018-11-10 10:00:36,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1779880425, now seen corresponding path program 1 times [2018-11-10 10:00:36,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,465 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 1 times [2018-11-10 10:00:36,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1486993640, now seen corresponding path program 1 times [2018-11-10 10:00:36,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:36,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:00:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:00:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:00:36,673 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. cyclomatic complexity: 18 Second operand 10 states. [2018-11-10 10:00:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:36,914 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-11-10 10:00:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:00:36,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 150 transitions. [2018-11-10 10:00:36,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 10:00:36,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 122 states and 150 transitions. [2018-11-10 10:00:36,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 10:00:36,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 10:00:36,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 150 transitions. [2018-11-10 10:00:36,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:36,919 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 150 transitions. [2018-11-10 10:00:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 150 transitions. [2018-11-10 10:00:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2018-11-10 10:00:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 10:00:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-11-10 10:00:36,923 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-11-10 10:00:36,923 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-11-10 10:00:36,923 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:00:36,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 93 transitions. [2018-11-10 10:00:36,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:36,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:36,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:36,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:36,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:36,925 INFO L793 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 509#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 510#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 518#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 503#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 504#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 534#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 564#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 550#L55 assume parse_expression_list_#t~switch3; 528#L56-9 assume true; 524#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 520#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 514#L56-3 assume !parse_expression_list_#t~short6; 515#L56-5 [2018-11-10 10:00:36,925 INFO L795 eck$LassoCheckResult]: Loop: 515#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 541#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 535#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 537#L56-9 assume true; 567#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 566#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 565#L56-3 assume !parse_expression_list_#t~short6; 515#L56-5 [2018-11-10 10:00:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash -47967536, now seen corresponding path program 1 times [2018-11-10 10:00:36,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 142559275, now seen corresponding path program 1 times [2018-11-10 10:00:36,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:36,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1894367620, now seen corresponding path program 1 times [2018-11-10 10:00:36,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:37,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:37,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:00:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:00:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:00:37,203 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-10 10:00:37,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:37,402 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2018-11-10 10:00:37,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:00:37,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2018-11-10 10:00:37,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 10:00:37,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 122 states and 148 transitions. [2018-11-10 10:00:37,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-10 10:00:37,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 10:00:37,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 148 transitions. [2018-11-10 10:00:37,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:37,406 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 148 transitions. [2018-11-10 10:00:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 148 transitions. [2018-11-10 10:00:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-11-10 10:00:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 10:00:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2018-11-10 10:00:37,411 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-10 10:00:37,411 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 99 transitions. [2018-11-10 10:00:37,411 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:00:37,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 99 transitions. [2018-11-10 10:00:37,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:37,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:37,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:37,412 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:37,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:37,413 INFO L793 eck$LassoCheckResult]: Stem: 775#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 738#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 739#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 747#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 732#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 733#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 763#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 795#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 780#L55 assume !parse_expression_list_#t~switch3; 773#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 771#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 761#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 762#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 748#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 740#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 742#L55 assume parse_expression_list_#t~switch3; 797#L56-9 [2018-11-10 10:00:37,413 INFO L795 eck$LassoCheckResult]: Loop: 797#L56-9 assume true; 802#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 801#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 799#L56-3 assume parse_expression_list_#t~short6; 796#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 797#L56-9 [2018-11-10 10:00:37,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash -298635564, now seen corresponding path program 1 times [2018-11-10 10:00:37,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:37,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:37,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 2 times [2018-11-10 10:00:37,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:37,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash -476166899, now seen corresponding path program 1 times [2018-11-10 10:00:37,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:37,677 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 109 [2018-11-10 10:00:37,734 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:00:37,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:00:37,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:00:37,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:00:37,735 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:00:37,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:00:37,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:00:37,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:00:37,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-10 10:00:37,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:00:37,735 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:00:37,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:37,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:38,116 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:00:38,117 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:00:38,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:38,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:38,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:38,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,159 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:38,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,161 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:38,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,165 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:38,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:38,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:38,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:38,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:38,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:38,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:38,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:38,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:38,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:38,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:00:38,203 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 10:00:38,204 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 10:00:38,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:00:38,205 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:00:38,205 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:00:38,205 INFO L519 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_~str.offset, ULTIMATE.start_parse_expression_list_~start~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_2 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [] [2018-11-10 10:00:38,237 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 10:00:38,239 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 10:00:38,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:38,294 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 10:00:38,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 99 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-11-10 10:00:38,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 99 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 264 states and 324 transitions. Complement of second has 7 states. [2018-11-10 10:00:38,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 10:00:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 10:00:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2018-11-10 10:00:38,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 10:00:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 10:00:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:38,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-10 10:00:38,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:38,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 324 transitions. [2018-11-10 10:00:38,363 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 37 [2018-11-10 10:00:38,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 202 states and 246 transitions. [2018-11-10 10:00:38,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 10:00:38,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 10:00:38,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 246 transitions. [2018-11-10 10:00:38,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:38,369 INFO L705 BuchiCegarLoop]: Abstraction has 202 states and 246 transitions. [2018-11-10 10:00:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 246 transitions. [2018-11-10 10:00:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 131. [2018-11-10 10:00:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 10:00:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2018-11-10 10:00:38,376 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 161 transitions. [2018-11-10 10:00:38,376 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 161 transitions. [2018-11-10 10:00:38,376 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:00:38,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 161 transitions. [2018-11-10 10:00:38,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:38,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:38,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:38,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 10:00:38,380 INFO L793 eck$LassoCheckResult]: Stem: 1254#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1208#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 1217#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1203#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1204#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1239#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 1209#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1210#L55 assume parse_expression_list_#t~switch3; 1230#L56-9 assume true; 1232#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 1222#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 1212#L56-3 assume !parse_expression_list_#t~short6; 1213#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 1245#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 1241#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 1242#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 1265#L57 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 1260#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1193#L59-13 [2018-11-10 10:00:38,380 INFO L795 eck$LassoCheckResult]: Loop: 1193#L59-13 assume true; 1228#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1235#L59-2 assume !parse_expression_list_#t~short13; 1192#L59-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1193#L59-13 [2018-11-10 10:00:38,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,380 INFO L82 PathProgramCache]: Analyzing trace with hash -199695591, now seen corresponding path program 1 times [2018-11-10 10:00:38,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2557577, now seen corresponding path program 1 times [2018-11-10 10:00:38,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:38,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:38,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:00:38,408 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:00:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:00:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:00:38,409 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-10 10:00:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:38,418 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2018-11-10 10:00:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:00:38,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 162 transitions. [2018-11-10 10:00:38,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:38,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 132 states and 161 transitions. [2018-11-10 10:00:38,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 10:00:38,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 10:00:38,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 161 transitions. [2018-11-10 10:00:38,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:38,421 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-10 10:00:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 161 transitions. [2018-11-10 10:00:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-10 10:00:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 10:00:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2018-11-10 10:00:38,428 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-10 10:00:38,428 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 161 transitions. [2018-11-10 10:00:38,428 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:00:38,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 161 transitions. [2018-11-10 10:00:38,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:38,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:38,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:38,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,430 INFO L793 eck$LassoCheckResult]: Stem: 1522#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1478#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 1486#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1471#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1472#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1487#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 1479#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1480#L55 assume parse_expression_list_#t~switch3; 1498#L56-9 assume true; 1499#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 1585#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 1583#L56-3 assume !parse_expression_list_#t~short6; 1579#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 1514#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 1509#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 1510#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 1534#L57 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 1527#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1463#L59-13 [2018-11-10 10:00:38,430 INFO L795 eck$LassoCheckResult]: Loop: 1463#L59-13 assume true; 1495#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1504#L59-2 assume parse_expression_list_#t~short13; 1532#L59-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L59-3 1529#L59-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 1524#L59-5 assume parse_expression_list_#t~short12; 1468#L59-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1462#L59-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1463#L59-13 [2018-11-10 10:00:38,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash -199695591, now seen corresponding path program 2 times [2018-11-10 10:00:38,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,449 INFO L82 PathProgramCache]: Analyzing trace with hash -642896305, now seen corresponding path program 1 times [2018-11-10 10:00:38,449 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:38,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash -895583897, now seen corresponding path program 1 times [2018-11-10 10:00:38,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:38,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:00:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:00:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:00:38,560 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. cyclomatic complexity: 35 Second operand 6 states. [2018-11-10 10:00:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:38,618 INFO L93 Difference]: Finished difference Result 201 states and 239 transitions. [2018-11-10 10:00:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:00:38,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 239 transitions. [2018-11-10 10:00:38,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-10 10:00:38,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 179 states and 216 transitions. [2018-11-10 10:00:38,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 10:00:38,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 10:00:38,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 216 transitions. [2018-11-10 10:00:38,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:38,621 INFO L705 BuchiCegarLoop]: Abstraction has 179 states and 216 transitions. [2018-11-10 10:00:38,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 216 transitions. [2018-11-10 10:00:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2018-11-10 10:00:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-10 10:00:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2018-11-10 10:00:38,625 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 159 transitions. [2018-11-10 10:00:38,625 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 159 transitions. [2018-11-10 10:00:38,625 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:00:38,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 159 transitions. [2018-11-10 10:00:38,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 10:00:38,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:38,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:38,626 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,627 INFO L793 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1827#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1828#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 1838#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 1821#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1822#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1859#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 1904#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1902#L55 assume !parse_expression_list_#t~switch3; 1903#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 1939#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 1938#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 1937#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 1935#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 1931#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 1928#L55 assume parse_expression_list_#t~switch3; 1925#L56-9 assume true; 1922#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 1920#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 1915#L56-3 assume parse_expression_list_#t~short6; 1911#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 1909#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 1905#L57 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 1871#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1813#L59-13 [2018-11-10 10:00:38,627 INFO L795 eck$LassoCheckResult]: Loop: 1813#L59-13 assume true; 1847#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 1852#L59-2 assume parse_expression_list_#t~short13; 1876#L59-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L59-3 1873#L59-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 1869#L59-5 assume parse_expression_list_#t~short12; 1818#L59-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 1812#L59-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 1813#L59-13 [2018-11-10 10:00:38,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash 788872803, now seen corresponding path program 1 times [2018-11-10 10:00:38,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:00:38,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:38,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:00:38,640 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:00:38,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash -642896305, now seen corresponding path program 2 times [2018-11-10 10:00:38,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:00:38,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:00:38,691 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-10 10:00:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:38,697 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-11-10 10:00:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:00:38,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 163 transitions. [2018-11-10 10:00:38,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:38,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 161 transitions. [2018-11-10 10:00:38,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 10:00:38,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-10 10:00:38,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 161 transitions. [2018-11-10 10:00:38,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:38,700 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-11-10 10:00:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 161 transitions. [2018-11-10 10:00:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-10 10:00:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 10:00:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-11-10 10:00:38,703 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-11-10 10:00:38,703 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-11-10 10:00:38,703 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:00:38,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 161 transitions. [2018-11-10 10:00:38,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:38,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:38,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:38,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,705 INFO L793 eck$LassoCheckResult]: Stem: 2141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2104#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 2111#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2099#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2100#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2112#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 2105#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2106#L55 assume !parse_expression_list_#t~switch3; 2146#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 2208#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 2180#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 2179#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2177#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 2175#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2174#L55 assume parse_expression_list_#t~switch3; 2173#L56-9 assume true; 2171#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 2170#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 2168#L56-3 assume !parse_expression_list_#t~short6; 2167#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 2165#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 2162#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 2160#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 2157#L57 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 2147#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2089#L59-13 [2018-11-10 10:00:38,705 INFO L795 eck$LassoCheckResult]: Loop: 2089#L59-13 assume true; 2120#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2126#L59-2 assume parse_expression_list_#t~short13; 2152#L59-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L59-3 2149#L59-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 2143#L59-5 assume parse_expression_list_#t~short12; 2094#L59-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2088#L59-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 2089#L59-13 [2018-11-10 10:00:38,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash -480094714, now seen corresponding path program 1 times [2018-11-10 10:00:38,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:38,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,718 INFO L82 PathProgramCache]: Analyzing trace with hash -642896305, now seen corresponding path program 3 times [2018-11-10 10:00:38,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,736 INFO L82 PathProgramCache]: Analyzing trace with hash 498118484, now seen corresponding path program 1 times [2018-11-10 10:00:38,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:38,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:38,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:00:38,781 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:00:38,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:38,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:38,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:00:38,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 10:00:38,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:00:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:00:38,899 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. cyclomatic complexity: 31 Second operand 7 states. [2018-11-10 10:00:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:38,967 INFO L93 Difference]: Finished difference Result 277 states and 330 transitions. [2018-11-10 10:00:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:00:38,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 277 states and 330 transitions. [2018-11-10 10:00:38,969 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-10 10:00:38,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 277 states to 251 states and 298 transitions. [2018-11-10 10:00:38,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-10 10:00:38,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 10:00:38,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 298 transitions. [2018-11-10 10:00:38,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:38,971 INFO L705 BuchiCegarLoop]: Abstraction has 251 states and 298 transitions. [2018-11-10 10:00:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 298 transitions. [2018-11-10 10:00:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 201. [2018-11-10 10:00:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-10 10:00:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 238 transitions. [2018-11-10 10:00:38,975 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 238 transitions. [2018-11-10 10:00:38,975 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 238 transitions. [2018-11-10 10:00:38,975 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 10:00:38,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 238 transitions. [2018-11-10 10:00:38,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 10:00:38,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:38,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:38,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:38,977 INFO L793 eck$LassoCheckResult]: Stem: 2675#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2637#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2638#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 2646#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 2631#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2632#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2650#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 2644#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2645#L55 assume !parse_expression_list_#t~switch3; 2672#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 2670#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 2662#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 2663#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2664#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 2762#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2760#L55 assume !parse_expression_list_#t~switch3; 2758#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 2753#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 2751#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 2750#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 2749#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 2746#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 2744#L55 assume parse_expression_list_#t~switch3; 2742#L56-9 assume true; 2738#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 2736#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 2733#L56-3 assume !parse_expression_list_#t~short6; 2732#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 2730#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 2728#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 2688#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 2689#L57 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 2681#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2623#L59-13 [2018-11-10 10:00:38,977 INFO L795 eck$LassoCheckResult]: Loop: 2623#L59-13 assume true; 2655#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 2660#L59-2 assume parse_expression_list_#t~short13; 2686#L59-3 SUMMARY for call parse_expression_list_#t~mem10 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0 * 1, 1); srcloc: L59-3 2683#L59-4 parse_expression_list_#t~short12 := parse_expression_list_#t~mem10 == 32; 2677#L59-5 assume parse_expression_list_#t~short12; 2628#L59-9 parse_expression_list_#t~short13 := parse_expression_list_#t~short12; 2622#L59-11 assume !!parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;parse_expression_list_#t~post14 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post14 - 1;havoc parse_expression_list_#t~post14; 2623#L59-13 [2018-11-10 10:00:38,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2046037177, now seen corresponding path program 1 times [2018-11-10 10:00:38,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -642896305, now seen corresponding path program 4 times [2018-11-10 10:00:38,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:38,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:38,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -435813625, now seen corresponding path program 1 times [2018-11-10 10:00:38,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:39,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:39,438 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 142 [2018-11-10 10:00:39,516 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:00:39,516 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:00:39,516 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:00:39,516 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:00:39,516 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:00:39,516 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:00:39,516 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:00:39,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:00:39,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER__cases1_stripFullBoth_arr_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-10 10:00:39,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:00:39,516 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:00:39,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:39,747 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-11-10 10:00:39,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:00:40,073 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:00:40,073 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:00:40,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,136 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,137 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:40,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,138 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:40,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,150 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:40,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:40,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,164 INFO L205 nArgumentSynthesizer]: 5 stem disjuncts [2018-11-10 10:00:40,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,165 INFO L402 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2018-11-10 10:00:40,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,177 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:00:40,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,178 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:00:40,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:00:40,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:00:40,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:00:40,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:00:40,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:00:40,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:00:40,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:00:40,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:00:40,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:00:40,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:00:40,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:00:40,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:00:40,220 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:00:40,221 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 10:00:40,221 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:00:40,222 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:00:40,222 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:00:40,222 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~j~0) = 1*ULTIMATE.start_parse_expression_list_~j~0 Supporting invariants [] [2018-11-10 10:00:40,302 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 10:00:40,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:40,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:40,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:40,346 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 10:00:40,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 238 transitions. cyclomatic complexity: 46 Second operand 5 states. [2018-11-10 10:00:40,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 238 transitions. cyclomatic complexity: 46. Second operand 5 states. Result 450 states and 541 transitions. Complement of second has 11 states. [2018-11-10 10:00:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:00:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 10:00:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2018-11-10 10:00:40,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 105 transitions. Stem has 33 letters. Loop has 8 letters. [2018-11-10 10:00:40,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:40,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 105 transitions. Stem has 41 letters. Loop has 8 letters. [2018-11-10 10:00:40,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:40,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 105 transitions. Stem has 33 letters. Loop has 16 letters. [2018-11-10 10:00:40,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:00:40,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 541 transitions. [2018-11-10 10:00:40,416 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-10 10:00:40,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 292 states and 349 transitions. [2018-11-10 10:00:40,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 10:00:40,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 10:00:40,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 349 transitions. [2018-11-10 10:00:40,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:40,417 INFO L705 BuchiCegarLoop]: Abstraction has 292 states and 349 transitions. [2018-11-10 10:00:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 349 transitions. [2018-11-10 10:00:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 211. [2018-11-10 10:00:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-11-10 10:00:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 250 transitions. [2018-11-10 10:00:40,420 INFO L728 BuchiCegarLoop]: Abstraction has 211 states and 250 transitions. [2018-11-10 10:00:40,420 INFO L608 BuchiCegarLoop]: Abstraction has 211 states and 250 transitions. [2018-11-10 10:00:40,420 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 10:00:40,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 250 transitions. [2018-11-10 10:00:40,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 10:00:40,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:40,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:40,422 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:40,422 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:40,422 INFO L793 eck$LassoCheckResult]: Stem: 3547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3509#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 3519#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3504#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3505#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3539#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 3617#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3615#L55 assume parse_expression_list_#t~switch3; 3614#L56-9 assume true; 3612#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 3610#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3608#L56-3 assume !parse_expression_list_#t~short6; 3606#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 3604#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 3602#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 3600#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 3598#L57 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 3597#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3596#L59-13 assume true; 3595#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3594#L59-2 assume !parse_expression_list_#t~short13; 3593#L59-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 3592#L59-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3590#L60 assume !parse_expression_list_#t~short16; 3588#L60-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 3587#L60-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;assume { :begin_inline_r_strncpy } true;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 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3586#L4 assume !(__VERIFIER_assert_~cond == 0); 3585#L4-2 assume { :end_inline___VERIFIER_assert } true; 3584#L64 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L64 3583#L64-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 3582#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 3581#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 3580#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 3579#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3578#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 3576#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3575#L55 assume parse_expression_list_#t~switch3; 3574#L56-9 [2018-11-10 10:00:40,422 INFO L795 eck$LassoCheckResult]: Loop: 3574#L56-9 assume true; 3573#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 3521#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3513#L56-3 assume parse_expression_list_#t~short6; 3514#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 3574#L56-9 [2018-11-10 10:00:40,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1538479893, now seen corresponding path program 1 times [2018-11-10 10:00:40,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:40,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:40,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:40,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:00:40,475 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:00:40,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,475 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 3 times [2018-11-10 10:00:40,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:00:40,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:00:40,526 INFO L87 Difference]: Start difference. First operand 211 states and 250 transitions. cyclomatic complexity: 48 Second operand 6 states. [2018-11-10 10:00:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:40,600 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2018-11-10 10:00:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:00:40,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 266 transitions. [2018-11-10 10:00:40,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 10:00:40,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 207 states and 245 transitions. [2018-11-10 10:00:40,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 10:00:40,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 10:00:40,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 245 transitions. [2018-11-10 10:00:40,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:40,604 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 245 transitions. [2018-11-10 10:00:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 245 transitions. [2018-11-10 10:00:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2018-11-10 10:00:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-10 10:00:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 241 transitions. [2018-11-10 10:00:40,607 INFO L728 BuchiCegarLoop]: Abstraction has 203 states and 241 transitions. [2018-11-10 10:00:40,607 INFO L608 BuchiCegarLoop]: Abstraction has 203 states and 241 transitions. [2018-11-10 10:00:40,607 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 10:00:40,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 203 states and 241 transitions. [2018-11-10 10:00:40,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 10:00:40,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:40,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:40,609 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:40,609 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:40,609 INFO L793 eck$LassoCheckResult]: Stem: 3993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3956#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3957#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 3965#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3949#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3950#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 3984#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 3958#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3959#L55 assume parse_expression_list_#t~switch3; 3979#L56-9 assume true; 3973#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 3969#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3963#L56-3 assume !parse_expression_list_#t~short6; 3964#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 3988#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 3985#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 3986#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 4009#L57 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 4001#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3976#L59-13 assume true; 3977#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 3981#L59-2 assume !parse_expression_list_#t~short13; 3942#L59-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 3943#L59-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 3974#L60 assume !parse_expression_list_#t~short16; 4018#L60-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 4019#L60-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;assume { :begin_inline_r_strncpy } true;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 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4048#L4 assume !(__VERIFIER_assert_~cond == 0); 4046#L4-2 assume { :end_inline___VERIFIER_assert } true; 4044#L64 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L64 3991#L64-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 3992#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4092#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 4090#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 4083#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4078#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4059#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 3998#L55 assume parse_expression_list_#t~switch3; 3978#L56-9 [2018-11-10 10:00:40,609 INFO L795 eck$LassoCheckResult]: Loop: 3978#L56-9 assume true; 3972#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 3968#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 3960#L56-3 assume parse_expression_list_#t~short6; 3961#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 3978#L56-9 [2018-11-10 10:00:40,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1115778067, now seen corresponding path program 1 times [2018-11-10 10:00:40,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:00:40,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:00:40,683 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:00:40,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 4 times [2018-11-10 10:00:40,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:00:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:00:40,725 INFO L87 Difference]: Start difference. First operand 203 states and 241 transitions. cyclomatic complexity: 47 Second operand 7 states. [2018-11-10 10:00:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:40,830 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2018-11-10 10:00:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:00:40,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 205 transitions. [2018-11-10 10:00:40,832 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:40,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 154 states and 183 transitions. [2018-11-10 10:00:40,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 10:00:40,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 10:00:40,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 183 transitions. [2018-11-10 10:00:40,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:40,834 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 183 transitions. [2018-11-10 10:00:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 183 transitions. [2018-11-10 10:00:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-10 10:00:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 10:00:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2018-11-10 10:00:40,836 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 183 transitions. [2018-11-10 10:00:40,836 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 183 transitions. [2018-11-10 10:00:40,836 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 10:00:40,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 183 transitions. [2018-11-10 10:00:40,837 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:40,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:40,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:40,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:40,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:40,838 INFO L793 eck$LassoCheckResult]: Stem: 4389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4351#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 4360#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4344#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4345#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4378#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4471#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4470#L55 assume !parse_expression_list_#t~switch3; 4468#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4466#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 4463#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 4462#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4461#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4460#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4459#L55 assume parse_expression_list_#t~switch3; 4372#L56-9 assume true; 4373#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 4486#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4485#L56-3 assume !parse_expression_list_#t~short6; 4386#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 4383#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 4384#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 4483#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 4481#L57 assume parse_expression_list_#t~mem8 == 34;havoc parse_expression_list_#t~mem8;parse_expression_list_#t~post9 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post9 + 1;havoc parse_expression_list_#t~post9; 4395#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4369#L59-13 assume true; 4370#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4375#L59-2 assume !parse_expression_list_#t~short13; 4404#L59-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 4413#L59-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4408#L60 assume !parse_expression_list_#t~short16; 4406#L60-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 4364#L60-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;assume { :begin_inline_r_strncpy } true;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 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4365#L4 assume !(__VERIFIER_assert_~cond == 0); 4398#L4-2 assume { :end_inline___VERIFIER_assert } true; 4390#L64 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L64 4388#L64-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 4387#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4385#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 4376#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 4377#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4361#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4352#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4353#L55 assume parse_expression_list_#t~switch3; 4371#L56-9 [2018-11-10 10:00:40,838 INFO L795 eck$LassoCheckResult]: Loop: 4371#L56-9 assume true; 4366#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 4362#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4355#L56-3 assume parse_expression_list_#t~short6; 4356#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 4371#L56-9 [2018-11-10 10:00:40,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 299849696, now seen corresponding path program 1 times [2018-11-10 10:00:40,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:40,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:00:40,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:00:40,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:00:40,906 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:00:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 5 times [2018-11-10 10:00:40,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:40,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:40,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:00:40,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:00:40,948 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-10 10:00:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:41,045 INFO L93 Difference]: Finished difference Result 247 states and 292 transitions. [2018-11-10 10:00:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:00:41,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 292 transitions. [2018-11-10 10:00:41,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:41,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 209 states and 246 transitions. [2018-11-10 10:00:41,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 10:00:41,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 10:00:41,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 246 transitions. [2018-11-10 10:00:41,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:00:41,048 INFO L705 BuchiCegarLoop]: Abstraction has 209 states and 246 transitions. [2018-11-10 10:00:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 246 transitions. [2018-11-10 10:00:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 167. [2018-11-10 10:00:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-10 10:00:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions. [2018-11-10 10:00:41,053 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-11-10 10:00:41,053 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 197 transitions. [2018-11-10 10:00:41,053 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 10:00:41,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 197 transitions. [2018-11-10 10:00:41,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 10:00:41,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:00:41,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:00:41,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:00:41,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:00:41,058 INFO L793 eck$LassoCheckResult]: Stem: 4805#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4764#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret19, main_~#A~0.base, main_~#A~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 9;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#A~0.base, main_~#A~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4765#L76 SUMMARY for call write~int(0, main_~#A~0.base, main_~#A~0.offset + 8, 1); srcloc: L76 4774#L76-1 assume { :begin_inline_parse_expression_list } true;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~post1, parse_expression_list_#t~mem2, parse_expression_list_#t~switch3, parse_expression_list_#t~post7, parse_expression_list_#t~mem4, parse_expression_list_#t~mem5, parse_expression_list_#t~short6, parse_expression_list_#t~mem8, parse_expression_list_#t~post9, parse_expression_list_#t~post14, parse_expression_list_#t~mem10, parse_expression_list_#t~mem11, parse_expression_list_#t~short12, parse_expression_list_#t~short13, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~post17, parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset, parse_expression_list_#t~mem0, 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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 2;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 4760#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4761#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4795#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4903#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4902#L55 assume !parse_expression_list_#t~switch3; 4901#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4900#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 4899#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 4898#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4897#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4896#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4895#L55 assume parse_expression_list_#t~switch3; 4894#L56-9 assume true; 4893#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 4892#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4891#L56-3 assume !parse_expression_list_#t~short6; 4890#L56-5 SUMMARY for call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-5 4889#L56-6 parse_expression_list_#t~short6 := parse_expression_list_#t~mem5 == 9; 4875#L56-7 assume !parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6; 4873#L56-10 SUMMARY for call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-10 4871#L57 assume !(parse_expression_list_#t~mem8 == 34);havoc parse_expression_list_#t~mem8; 4864#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4862#L59-13 assume true; 4860#L59-1 parse_expression_list_#t~short13 := 0 < parse_expression_list_~j~0; 4838#L59-2 assume !parse_expression_list_#t~short13; 4835#L59-11 assume !parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem10;havoc parse_expression_list_#t~short12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13; 4834#L59-14 parse_expression_list_#t~short16 := 0 < parse_expression_list_~j~0; 4832#L60 assume !parse_expression_list_#t~short16; 4830#L60-4 assume !parse_expression_list_#t~short16;havoc parse_expression_list_#t~short16;havoc parse_expression_list_#t~mem15; 4775#L60-6 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;assume { :begin_inline_r_strncpy } true;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 + 1;havoc r_strncpy_#res.base, r_strncpy_#res.offset;parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset := r_strncpy_#res.base, r_strncpy_#res.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret18.base, parse_expression_list_#t~ret18.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1 < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4776#L4 assume !(__VERIFIER_assert_~cond == 0); 4814#L4-2 assume { :end_inline___VERIFIER_assert } true; 4804#L64 SUMMARY for call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (parse_expression_list_~j~0 - parse_expression_list_~start~0 + 1) * 1, 1); srcloc: L64 4802#L64-1 parse_expression_list_~start~0 := parse_expression_list_~i~0 + 1; 4803#L54-2 havoc parse_expression_list_#t~switch3;havoc parse_expression_list_#t~mem2; 4827#L52-1 SUMMARY for call parse_expression_list_#t~mem0 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L52-1 4826#L70 assume !!(parse_expression_list_#t~mem0 != 0);havoc parse_expression_list_#t~mem0; 4825#L52-3 assume true;parse_expression_list_#t~post1 := parse_expression_list_~i~0;parse_expression_list_~i~0 := parse_expression_list_#t~post1 + 1;havoc parse_expression_list_#t~post1; 4824#L54 SUMMARY for call parse_expression_list_#t~mem2 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0 * 1, 1); srcloc: L54 4822#L54-1 parse_expression_list_#t~switch3 := parse_expression_list_#t~mem2 == 0; 4810#L55 assume parse_expression_list_#t~switch3; 4786#L56-9 [2018-11-10 10:00:41,058 INFO L795 eck$LassoCheckResult]: Loop: 4786#L56-9 assume true; 4780#L56-1 SUMMARY for call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0 * 1, 1); srcloc: L56-1 4778#L56-2 parse_expression_list_#t~short6 := parse_expression_list_#t~mem4 == 32; 4768#L56-3 assume parse_expression_list_#t~short6; 4769#L56-7 assume !!parse_expression_list_#t~short6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem4;havoc parse_expression_list_#t~short6;parse_expression_list_#t~post7 := parse_expression_list_~start~0;parse_expression_list_~start~0 := parse_expression_list_#t~post7 + 1;havoc parse_expression_list_#t~post7; 4786#L56-9 [2018-11-10 10:00:41,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 722551522, now seen corresponding path program 1 times [2018-11-10 10:00:41,059 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:41,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:41,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:00:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:00:41,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:00:41,157 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_088072d0-5ca0-4053-992c-2d7008ea36a1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:00:41,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:41,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:00:41,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:00:41,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:00:41,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 10:00:41,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 10:00:41,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-10 10:00:41,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 10:00:41,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:00:41,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2018-11-10 10:00:41,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 10:00:41,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-10 10:00:41,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:00:41,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 10:00:41,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:00:41,368 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2018-11-10 10:00:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 10:00:41,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:00:41,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-11-10 10:00:41,409 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:00:41,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:00:41,409 INFO L82 PathProgramCache]: Analyzing trace with hash 49686528, now seen corresponding path program 6 times [2018-11-10 10:00:41,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:00:41,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:00:41,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:41,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:00:41,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:00:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:00:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:00:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:00:41,454 INFO L87 Difference]: Start difference. First operand 167 states and 197 transitions. cyclomatic complexity: 37 Second operand 12 states. [2018-11-10 10:00:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:00:41,663 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2018-11-10 10:00:41,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:00:41,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 137 transitions. [2018-11-10 10:00:41,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:00:41,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:00:41,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:00:41,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:00:41,665 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 10:00:41,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:00:41,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:00:41,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:00:41,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:00:41 BoogieIcfgContainer [2018-11-10 10:00:41,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:00:41,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:00:41,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:00:41,671 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:00:41,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:00:35" (3/4) ... [2018-11-10 10:00:41,675 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:00:41,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:00:41,676 INFO L168 Benchmark]: Toolchain (without parser) took 7237.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -222.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:00:41,676 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:00:41,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.49 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:00:41,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:00:41,678 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:00:41,678 INFO L168 Benchmark]: RCFGBuilder took 291.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:00:41,678 INFO L168 Benchmark]: BuchiAutomizer took 6670.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:00:41,679 INFO L168 Benchmark]: Witness Printer took 4.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:00:41,682 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.49 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 291.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6670.14 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.00 ms. Allocated memory is still 1.2 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 13 terminating modules (10 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * start and consists of 4 locations. One deterministic module has affine ranking function j and consists of 6 locations. 10 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 4.9s. Construction of modules took 0.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 381 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 211 states and ocurred in iteration 9. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 671 SDtfs, 1450 SDslu, 1707 SDs, 0 SdLazy, 973 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc4 concLT0 SILN0 SILU5 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital168 mio100 ax100 hnf101 lsp89 ukn91 mio100 lsp41 div100 bol100 ite100 ukn100 eq190 hnf85 smp96 dnf182 smp76 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...