./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8770e865452d763f6a1ae70a92c5caf41552c1e5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:48:18,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:48:18,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:48:18,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:48:18,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:48:18,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:48:18,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:48:18,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:48:18,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:48:18,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:48:18,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:48:18,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:48:18,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:48:18,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:48:18,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:48:18,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:48:18,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:48:18,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:48:18,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:48:18,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:48:18,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:48:18,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:48:18,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:48:18,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:48:18,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:48:18,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:48:18,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:48:18,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:48:18,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:48:18,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:48:18,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:48:18,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:48:18,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:48:18,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:48:18,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:48:18,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:48:18,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:48:18,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:48:18,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:48:18,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:48:18,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:48:18,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:48:18,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:48:18,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:48:18,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:48:18,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:48:18,917 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:48:18,917 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:48:18,917 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:48:18,918 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:48:18,918 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:48:18,918 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:48:18,919 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:48:18,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:48:18,920 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:48:18,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:48:18,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:48:18,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:48:18,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:48:18,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:48:18,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:48:18,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:48:18,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:48:18,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:48:18,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:48:18,922 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:48:18,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:48:18,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:48:18,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:48:18,923 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:48:18,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:48:18,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:48:18,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:48:18,923 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:48:18,925 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:48:18,926 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8770e865452d763f6a1ae70a92c5caf41552c1e5 [2020-10-26 04:48:19,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:48:19,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:48:19,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:48:19,388 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:48:19,389 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:48:19,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-26 04:48:19,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34af796cd/66b2e325ebf84b81995180e37528bbf3/FLAGfdef8cc98 [2020-10-26 04:48:20,274 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:48:20,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-26 04:48:20,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34af796cd/66b2e325ebf84b81995180e37528bbf3/FLAGfdef8cc98 [2020-10-26 04:48:20,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34af796cd/66b2e325ebf84b81995180e37528bbf3 [2020-10-26 04:48:20,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:48:20,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:48:20,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:48:20,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:48:20,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:48:20,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:20,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ca24c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20, skipping insertion in model container [2020-10-26 04:48:20,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:20,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:48:20,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:48:20,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:48:20,899 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:48:20,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:48:20,974 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:48:20,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20 WrapperNode [2020-10-26 04:48:20,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:48:20,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:48:20,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:48:20,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:48:20,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:20,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:48:21,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:48:21,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:48:21,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:48:21,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... [2020-10-26 04:48:21,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:48:21,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:48:21,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:48:21,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:48:21,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:21,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:48:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:48:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:48:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:48:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-10-26 04:48:21,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:48:21,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:48:21,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:48:21,610 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:48:21,611 INFO L298 CfgBuilder]: Removed 15 assume(true) statements. [2020-10-26 04:48:21,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:48:21 BoogieIcfgContainer [2020-10-26 04:48:21,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:48:21,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:48:21,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:48:21,618 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:48:21,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:48:21,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:48:20" (1/3) ... [2020-10-26 04:48:21,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a818bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:48:21, skipping insertion in model container [2020-10-26 04:48:21,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:48:21,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:48:20" (2/3) ... [2020-10-26 04:48:21,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a818bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:48:21, skipping insertion in model container [2020-10-26 04:48:21,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:48:21,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:48:21" (3/3) ... [2020-10-26 04:48:21,623 INFO L373 chiAutomizerObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2020-10-26 04:48:21,689 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:48:21,689 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:48:21,689 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:48:21,690 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:48:21,690 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:48:21,690 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:48:21,690 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:48:21,690 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:48:21,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-10-26 04:48:21,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-26 04:48:21,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:21,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:21,741 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:48:21,741 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:21,741 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:48:21,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-10-26 04:48:21,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-26 04:48:21,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:21,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:21,745 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:48:21,745 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:21,753 INFO L794 eck$LassoCheckResult]: Stem: 32#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 9#L-1true havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 28#L61true assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3#L62-4true [2020-10-26 04:48:21,754 INFO L796 eck$LassoCheckResult]: Loop: 3#L62-4true parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 12#L65true assume !parse_expression_list_#t~switch7; 33#L64true havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 8#L62-1true call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 5#L62-2true assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 3#L62-4true [2020-10-26 04:48:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-26 04:48:21,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:21,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139451261] [2020-10-26 04:48:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:21,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:21,985 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:22,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:22,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash 42114609, now seen corresponding path program 1 times [2020-10-26 04:48:22,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:22,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923909115] [2020-10-26 04:48:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:22,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:22,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:22,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash 181442414, now seen corresponding path program 1 times [2020-10-26 04:48:22,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:22,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561598861] [2020-10-26 04:48:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:22,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:22,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:22,120 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:22,227 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-10-26 04:48:22,646 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2020-10-26 04:48:22,819 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-26 04:48:22,831 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:48:22,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:48:22,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:48:22,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:48:22,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:48:22,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:22,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:48:22,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:48:22,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2020-10-26 04:48:22,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:48:22,834 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:48:22,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:22,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,306 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-26 04:48:23,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:23,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:48:23,897 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:23,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:23,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:23,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:23,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:23,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:23,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:23,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:23,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:23,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:23,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:23,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:23,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:23,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:23,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:23,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:23,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:23,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:23,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:24,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:24,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:24,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:24,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:24,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:24,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:24,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:24,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:24,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:24,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:24,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:24,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:24,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,517 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:24,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:24,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:24,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:24,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:24,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:24,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:24,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,690 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:48:24,747 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-10-26 04:48:24,748 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:24,757 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:24,760 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:48:24,761 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:48:24,762 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2020-10-26 04:48:24,845 INFO L297 tatePredicateManager]: 17 out of 18 supporting invariants were superfluous and have been removed [2020-10-26 04:48:24,855 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:48:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:24,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:48:24,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:24,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:48:24,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:25,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 04:48:25,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states. Second operand 4 states. [2020-10-26 04:48:25,265 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states.. Second operand 4 states. Result 100 states and 141 transitions. Complement of second has 7 states. [2020-10-26 04:48:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-26 04:48:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:48:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2020-10-26 04:48:25,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 3 letters. Loop has 5 letters. [2020-10-26 04:48:25,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:25,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 5 letters. [2020-10-26 04:48:25,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:25,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 3 letters. Loop has 10 letters. [2020-10-26 04:48:25,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:25,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 141 transitions. [2020-10-26 04:48:25,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:25,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 40 states and 55 transitions. [2020-10-26 04:48:25,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:48:25,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-26 04:48:25,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions. [2020-10-26 04:48:25,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:25,292 INFO L691 BuchiCegarLoop]: Abstraction has 40 states and 55 transitions. [2020-10-26 04:48:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions. [2020-10-26 04:48:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-10-26 04:48:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 04:48:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-10-26 04:48:25,326 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-10-26 04:48:25,326 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-10-26 04:48:25,327 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:48:25,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2020-10-26 04:48:25,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:25,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:25,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:25,330 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:25,330 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:48:25,330 INFO L794 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 278#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 279#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 263#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 264#L65 assume parse_expression_list_#t~switch7; 273#L66-5 [2020-10-26 04:48:25,330 INFO L796 eck$LassoCheckResult]: Loop: 273#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 274#L66-1 assume parse_expression_list_#t~short10; 298#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 273#L66-5 [2020-10-26 04:48:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2020-10-26 04:48:25,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248190433] [2020-10-26 04:48:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,402 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2020-10-26 04:48:25,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492808901] [2020-10-26 04:48:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,433 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash 178551732, now seen corresponding path program 1 times [2020-10-26 04:48:25,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369038634] [2020-10-26 04:48:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:25,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369038634] [2020-10-26 04:48:25,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:25,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 04:48:25,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582245143] [2020-10-26 04:48:25,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:48:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:48:25,760 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2020-10-26 04:48:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:25,915 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2020-10-26 04:48:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:48:25,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 97 transitions. [2020-10-26 04:48:25,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-26 04:48:25,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 97 transitions. [2020-10-26 04:48:25,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-26 04:48:25,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-26 04:48:25,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 97 transitions. [2020-10-26 04:48:25,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:25,922 INFO L691 BuchiCegarLoop]: Abstraction has 71 states and 97 transitions. [2020-10-26 04:48:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 97 transitions. [2020-10-26 04:48:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2020-10-26 04:48:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-26 04:48:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-10-26 04:48:25,927 INFO L714 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-10-26 04:48:25,927 INFO L594 BuchiCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-10-26 04:48:25,927 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:48:25,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2020-10-26 04:48:25,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:25,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:25,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:25,930 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:25,930 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:48:25,930 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 402#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 403#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 386#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 387#L65 assume !parse_expression_list_#t~switch7; 396#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 401#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 390#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 388#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 389#L65 assume parse_expression_list_#t~switch7; 429#L66-5 [2020-10-26 04:48:25,930 INFO L796 eck$LassoCheckResult]: Loop: 429#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 430#L66-1 assume parse_expression_list_#t~short10; 431#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 429#L66-5 [2020-10-26 04:48:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1727498927, now seen corresponding path program 1 times [2020-10-26 04:48:25,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015742698] [2020-10-26 04:48:25,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2020-10-26 04:48:25,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872363441] [2020-10-26 04:48:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:25,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:25,990 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1622374614, now seen corresponding path program 1 times [2020-10-26 04:48:25,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:25,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588282985] [2020-10-26 04:48:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:26,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:26,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:26,053 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:26,766 WARN L193 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 108 [2020-10-26 04:48:26,992 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-26 04:48:26,996 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:48:26,996 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:48:26,996 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:48:26,996 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:48:26,996 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:48:26,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:26,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:48:26,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:48:26,997 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration3_Lasso [2020-10-26 04:48:26,997 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:48:26,997 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:48:27,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,468 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-10-26 04:48:27,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:27,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:28,247 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:48:28,247 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:28,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:28,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:28,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:28,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:28,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:28,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:28,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:28,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:28,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:28,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:28,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:28,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:28,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:28,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:28,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:28,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:28,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:28,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:28,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:28,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:28,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:28,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:28,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:28,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:48:28,536 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-10-26 04:48:28,536 INFO L444 ModelExtractionUtils]: 1 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:28,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:48:28,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:48:28,543 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:48:28,543 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2, ULTIMATE.start_parse_expression_list_~start~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_2 - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [] [2020-10-26 04:48:28,665 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2020-10-26 04:48:28,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-26 04:48:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:28,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:48:28,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:28,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:48:28,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:28,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-26 04:48:28,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-10-26 04:48:28,918 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 63 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 153 states and 213 transitions. Complement of second has 8 states. [2020-10-26 04:48:28,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:48:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:48:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-10-26 04:48:28,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 3 letters. [2020-10-26 04:48:28,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:28,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 13 letters. Loop has 3 letters. [2020-10-26 04:48:28,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:28,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2020-10-26 04:48:28,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:28,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 213 transitions. [2020-10-26 04:48:28,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2020-10-26 04:48:28,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 115 states and 159 transitions. [2020-10-26 04:48:28,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-10-26 04:48:28,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-10-26 04:48:28,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 159 transitions. [2020-10-26 04:48:28,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:28,930 INFO L691 BuchiCegarLoop]: Abstraction has 115 states and 159 transitions. [2020-10-26 04:48:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 159 transitions. [2020-10-26 04:48:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 72. [2020-10-26 04:48:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-26 04:48:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2020-10-26 04:48:28,940 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-10-26 04:48:28,940 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 102 transitions. [2020-10-26 04:48:28,940 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:48:28,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 102 transitions. [2020-10-26 04:48:28,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:28,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:28,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:28,942 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:28,942 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:48:28,943 INFO L794 eck$LassoCheckResult]: Stem: 803#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 775#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 776#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 755#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 756#L65 assume parse_expression_list_#t~switch7; 767#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 768#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 826#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 761#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 762#L67 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 784#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 778#L69-8 [2020-10-26 04:48:28,943 INFO L796 eck$LassoCheckResult]: Loop: 778#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 794#L69-1 assume !parse_expression_list_#t~short17; 777#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 778#L69-8 [2020-10-26 04:48:28,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 1 times [2020-10-26 04:48:28,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:28,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837948940] [2020-10-26 04:48:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:29,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837948940] [2020-10-26 04:48:29,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:29,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 04:48:29,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208922794] [2020-10-26 04:48:29,143 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:48:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash 75859, now seen corresponding path program 1 times [2020-10-26 04:48:29,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382746465] [2020-10-26 04:48:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:29,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382746465] [2020-10-26 04:48:29,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:29,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:48:29,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723455655] [2020-10-26 04:48:29,154 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:48:29,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:48:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:48:29,155 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-10-26 04:48:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:29,210 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2020-10-26 04:48:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:48:29,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2020-10-26 04:48:29,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:29,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 73 states and 102 transitions. [2020-10-26 04:48:29,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-26 04:48:29,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-26 04:48:29,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 102 transitions. [2020-10-26 04:48:29,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:29,215 INFO L691 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-26 04:48:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 102 transitions. [2020-10-26 04:48:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-26 04:48:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-26 04:48:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2020-10-26 04:48:29,221 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-26 04:48:29,221 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 102 transitions. [2020-10-26 04:48:29,222 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:48:29,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 102 transitions. [2020-10-26 04:48:29,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:29,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:29,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:29,225 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:29,226 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:29,226 INFO L794 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 929#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 930#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 911#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 912#L65 assume parse_expression_list_#t~switch7; 923#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 924#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 964#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 961#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 958#L67 assume 34 == parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem12;parse_expression_list_#t~post13 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post13;havoc parse_expression_list_#t~post13; 937#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 932#L69-8 [2020-10-26 04:48:29,226 INFO L796 eck$LassoCheckResult]: Loop: 932#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 947#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 944#L69-2 assume parse_expression_list_#t~short16; 940#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 931#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 932#L69-8 [2020-10-26 04:48:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956886, now seen corresponding path program 2 times [2020-10-26 04:48:29,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474300102] [2020-10-26 04:48:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:29,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474300102] [2020-10-26 04:48:29,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:29,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 04:48:29,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711048996] [2020-10-26 04:48:29,393 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:48:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 1 times [2020-10-26 04:48:29,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642056983] [2020-10-26 04:48:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,407 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:29,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:48:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:48:29,494 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. cyclomatic complexity: 35 Second operand 6 states. [2020-10-26 04:48:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:29,645 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2020-10-26 04:48:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 04:48:29,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 138 transitions. [2020-10-26 04:48:29,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-10-26 04:48:29,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 97 states and 130 transitions. [2020-10-26 04:48:29,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-26 04:48:29,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-26 04:48:29,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 130 transitions. [2020-10-26 04:48:29,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:29,650 INFO L691 BuchiCegarLoop]: Abstraction has 97 states and 130 transitions. [2020-10-26 04:48:29,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 130 transitions. [2020-10-26 04:48:29,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 69. [2020-10-26 04:48:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-26 04:48:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2020-10-26 04:48:29,655 INFO L714 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-10-26 04:48:29,655 INFO L594 BuchiCegarLoop]: Abstraction has 69 states and 96 transitions. [2020-10-26 04:48:29,656 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:48:29,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 96 transitions. [2020-10-26 04:48:29,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:29,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:29,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:29,657 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:29,657 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:29,658 INFO L794 eck$LassoCheckResult]: Stem: 1142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1121#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1122#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1100#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1101#L65 assume parse_expression_list_#t~switch7; 1112#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1113#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1139#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1104#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1105#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 1123#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1118#L69-8 [2020-10-26 04:48:29,658 INFO L796 eck$LassoCheckResult]: Loop: 1118#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1134#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1131#L69-2 assume parse_expression_list_#t~short16; 1126#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1117#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1118#L69-8 [2020-10-26 04:48:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2066956948, now seen corresponding path program 1 times [2020-10-26 04:48:29,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160086174] [2020-10-26 04:48:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,689 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 2 times [2020-10-26 04:48:29,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236084749] [2020-10-26 04:48:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:29,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:29,699 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 733119365, now seen corresponding path program 1 times [2020-10-26 04:48:29,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:29,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042772081] [2020-10-26 04:48:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:29,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042772081] [2020-10-26 04:48:29,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:29,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 04:48:29,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871334048] [2020-10-26 04:48:29,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 04:48:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 04:48:29,888 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. cyclomatic complexity: 33 Second operand 6 states. [2020-10-26 04:48:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:30,018 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2020-10-26 04:48:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 04:48:30,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 151 transitions. [2020-10-26 04:48:30,026 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 04:48:30,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 143 transitions. [2020-10-26 04:48:30,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-26 04:48:30,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-26 04:48:30,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 143 transitions. [2020-10-26 04:48:30,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:30,029 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 143 transitions. [2020-10-26 04:48:30,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 143 transitions. [2020-10-26 04:48:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-10-26 04:48:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-26 04:48:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2020-10-26 04:48:30,035 INFO L714 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-10-26 04:48:30,035 INFO L594 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2020-10-26 04:48:30,036 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:48:30,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2020-10-26 04:48:30,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:30,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:30,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:30,038 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:30,038 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:30,038 INFO L794 eck$LassoCheckResult]: Stem: 1343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1317#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1318#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1301#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1302#L65 assume !parse_expression_list_#t~switch7; 1361#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1371#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1370#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1368#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1360#L65 assume parse_expression_list_#t~switch7; 1362#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1344#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1340#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1341#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1331#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 1324#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1320#L69-8 [2020-10-26 04:48:30,038 INFO L796 eck$LassoCheckResult]: Loop: 1320#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1335#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1332#L69-2 assume parse_expression_list_#t~short16; 1327#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1319#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1320#L69-8 [2020-10-26 04:48:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -893322402, now seen corresponding path program 1 times [2020-10-26 04:48:30,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959908786] [2020-10-26 04:48:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,078 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:30,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 3 times [2020-10-26 04:48:30,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247582659] [2020-10-26 04:48:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,084 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,092 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash -525682437, now seen corresponding path program 1 times [2020-10-26 04:48:30,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214819540] [2020-10-26 04:48:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:30,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214819540] [2020-10-26 04:48:30,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949134285] [2020-10-26 04:48:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:48:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:30,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 04:48:30,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:30,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:48:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:30,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:48:30,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-26 04:48:30,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172573649] [2020-10-26 04:48:30,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:30,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:48:30,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:48:30,396 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 32 Second operand 7 states. [2020-10-26 04:48:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:30,603 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2020-10-26 04:48:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 04:48:30,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 217 transitions. [2020-10-26 04:48:30,608 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 04:48:30,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 146 states and 195 transitions. [2020-10-26 04:48:30,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-26 04:48:30,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-10-26 04:48:30,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 195 transitions. [2020-10-26 04:48:30,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:30,617 INFO L691 BuchiCegarLoop]: Abstraction has 146 states and 195 transitions. [2020-10-26 04:48:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 195 transitions. [2020-10-26 04:48:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2020-10-26 04:48:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 04:48:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2020-10-26 04:48:30,631 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-10-26 04:48:30,631 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 151 transitions. [2020-10-26 04:48:30,631 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-26 04:48:30,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 151 transitions. [2020-10-26 04:48:30,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 04:48:30,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:30,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:30,633 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:30,633 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:48:30,634 INFO L794 eck$LassoCheckResult]: Stem: 1665#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 1639#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1640#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1617#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1618#L65 assume !parse_expression_list_#t~switch7; 1647#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1721#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1720#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1619#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1620#L65 assume !parse_expression_list_#t~switch7; 1705#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 1710#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1709#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 1707#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 1704#L65 assume parse_expression_list_#t~switch7; 1706#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 1633#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 1727#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 1726#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 1652#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 1641#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1636#L69-8 [2020-10-26 04:48:30,634 INFO L796 eck$LassoCheckResult]: Loop: 1636#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 1656#L69-1 assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem14 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short16 := 32 == parse_expression_list_#t~mem14; 1650#L69-2 assume parse_expression_list_#t~short16; 1644#L69-4 parse_expression_list_#t~short17 := parse_expression_list_#t~short16; 1635#L69-6 assume !!parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; 1636#L69-8 [2020-10-26 04:48:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2142843092, now seen corresponding path program 2 times [2020-10-26 04:48:30,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781324771] [2020-10-26 04:48:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,706 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash 72622648, now seen corresponding path program 4 times [2020-10-26 04:48:30,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442710696] [2020-10-26 04:48:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,720 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1058570939, now seen corresponding path program 2 times [2020-10-26 04:48:30,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:30,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018607808] [2020-10-26 04:48:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:30,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:30,767 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:31,814 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 144 [2020-10-26 04:48:32,057 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-26 04:48:32,059 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:48:32,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:48:32,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:48:32,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:48:32,059 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:48:32,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:32,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:48:32,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:48:32,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_OpenSER_cases1_stripFullBoth_arr.i_Iteration8_Lasso [2020-10-26 04:48:32,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:48:32,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:48:32,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,691 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2020-10-26 04:48:32,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:32,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:48:33,467 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2020-10-26 04:48:33,685 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:48:33,685 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:33,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:33,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:33,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:33,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:33,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:33,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:33,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:33,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,896 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:33,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:48:33,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:33,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:33,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:33,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:33,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:33,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:33,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:33,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:33,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:34,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:34,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:34,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:34,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:34,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:34,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:34,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:34,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:34,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:34,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:48:34,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:48:34,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:48:34,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:34,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,179 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,204 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-26 04:48:34,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,208 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-26 04:48:34,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,214 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:34,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,270 INFO L203 nArgumentSynthesizer]: 5 stem disjuncts [2020-10-26 04:48:34,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,276 INFO L401 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2020-10-26 04:48:34,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:34,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:48:34,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:48:34,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:48:34,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:48:34,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:48:34,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:48:34,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:48:34,378 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:48:34,404 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-26 04:48:34,404 INFO L444 ModelExtractionUtils]: 7 out of 31 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:48:34,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:48:34,409 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:48:34,409 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:48:34,409 INFO L512 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 [] [2020-10-26 04:48:34,570 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-10-26 04:48:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:34,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:48:34,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:34,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 04:48:34,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:34,662 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 [2020-10-26 04:48:34,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48 Second operand 4 states. [2020-10-26 04:48:34,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 151 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 267 states and 360 transitions. Complement of second has 11 states. [2020-10-26 04:48:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-26 04:48:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-26 04:48:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2020-10-26 04:48:34,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 5 letters. [2020-10-26 04:48:34,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:34,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 26 letters. Loop has 5 letters. [2020-10-26 04:48:34,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:34,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 76 transitions. Stem has 21 letters. Loop has 10 letters. [2020-10-26 04:48:34,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:48:34,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 360 transitions. [2020-10-26 04:48:34,832 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2020-10-26 04:48:34,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 170 states and 228 transitions. [2020-10-26 04:48:34,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-26 04:48:34,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-26 04:48:34,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 228 transitions. [2020-10-26 04:48:34,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:34,835 INFO L691 BuchiCegarLoop]: Abstraction has 170 states and 228 transitions. [2020-10-26 04:48:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 228 transitions. [2020-10-26 04:48:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2020-10-26 04:48:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-26 04:48:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 158 transitions. [2020-10-26 04:48:34,855 INFO L714 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-10-26 04:48:34,856 INFO L594 BuchiCegarLoop]: Abstraction has 118 states and 158 transitions. [2020-10-26 04:48:34,856 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-26 04:48:34,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 158 transitions. [2020-10-26 04:48:34,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-10-26 04:48:34,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:34,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:34,860 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:34,862 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:48:34,863 INFO L794 eck$LassoCheckResult]: Stem: 2291#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2270#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2271#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2250#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2251#L65 assume parse_expression_list_#t~switch7; 2320#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2319#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2318#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 2317#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2316#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2315#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2314#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2313#L69-1 assume !parse_expression_list_#t~short17; 2312#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16; 2311#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2310#L70 assume !parse_expression_list_#t~short20; 2309#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19;havoc parse_expression_list_#t~short20; 2308#L70-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 2307#L41 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2306#L14 assume !(0 == __VERIFIER_assert_~cond); 2305#L14-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2304#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2303#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2302#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2301#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2300#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2298#L65 assume parse_expression_list_#t~switch7; 2289#L66-5 [2020-10-26 04:48:34,863 INFO L796 eck$LassoCheckResult]: Loop: 2289#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2297#L66-1 assume parse_expression_list_#t~short10; 2288#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 2289#L66-5 [2020-10-26 04:48:34,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1563666499, now seen corresponding path program 1 times [2020-10-26 04:48:34,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:34,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961414032] [2020-10-26 04:48:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:48:34,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961414032] [2020-10-26 04:48:34,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:48:34,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:48:34,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673135042] [2020-10-26 04:48:34,940 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:48:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2020-10-26 04:48:34,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:34,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636134437] [2020-10-26 04:48:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:34,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:34,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:34,948 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:35,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:48:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:48:35,012 INFO L87 Difference]: Start difference. First operand 118 states and 158 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-10-26 04:48:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:35,169 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2020-10-26 04:48:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:48:35,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 162 transitions. [2020-10-26 04:48:35,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:35,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 108 states and 147 transitions. [2020-10-26 04:48:35,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-26 04:48:35,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-26 04:48:35,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 147 transitions. [2020-10-26 04:48:35,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:48:35,173 INFO L691 BuchiCegarLoop]: Abstraction has 108 states and 147 transitions. [2020-10-26 04:48:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 147 transitions. [2020-10-26 04:48:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2020-10-26 04:48:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-26 04:48:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2020-10-26 04:48:35,178 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-10-26 04:48:35,178 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 119 transitions. [2020-10-26 04:48:35,178 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-26 04:48:35,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 119 transitions. [2020-10-26 04:48:35,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-26 04:48:35,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:48:35,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:48:35,180 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:48:35,180 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:48:35,181 INFO L794 eck$LassoCheckResult]: Stem: 2546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(43); 2517#L-1 havoc main_#res;havoc main_#t~ret23, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post5, parse_expression_list_#t~mem6, parse_expression_list_#t~switch7, parse_expression_list_#t~post11, parse_expression_list_#t~mem8, parse_expression_list_#t~mem9, parse_expression_list_#t~short10, parse_expression_list_#t~mem12, parse_expression_list_#t~post13, parse_expression_list_#t~post18, parse_expression_list_#t~mem14, parse_expression_list_#t~mem15, parse_expression_list_#t~short16, parse_expression_list_#t~short17, parse_expression_list_#t~mem19, parse_expression_list_#t~short20, parse_expression_list_#t~post21, parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset, parse_expression_list_#t~mem4, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2518#L61 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2501#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2502#L65 assume !parse_expression_list_#t~switch7; 2523#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2586#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2585#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2584#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2583#L65 assume parse_expression_list_#t~switch7; 2580#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2579#L66-1 assume !parse_expression_list_#t~short10;call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 9 == parse_expression_list_#t~mem9; 2577#L66-3 assume !parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10; 2574#L66-6 call parse_expression_list_#t~mem12 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2572#L67 assume !(34 == parse_expression_list_#t~mem12);havoc parse_expression_list_#t~mem12; 2571#L67-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2541#L69-8 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 2537#L69-1 assume !parse_expression_list_#t~short17; 2538#L69-6 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem15;havoc parse_expression_list_#t~mem14;havoc parse_expression_list_#t~short17;havoc parse_expression_list_#t~short16; 2555#L69-9 parse_expression_list_#t~short20 := 0 < parse_expression_list_~j~0; 2553#L70 assume !parse_expression_list_#t~short20; 2551#L70-2 assume !parse_expression_list_#t~short20;havoc parse_expression_list_#t~mem19;havoc parse_expression_list_#t~short20; 2549#L70-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0;r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset;havoc r_strncpy_#t~ret3.base, r_strncpy_#t~ret3.offset; 2542#L41 parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret22.base, parse_expression_list_#t~ret22.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2535#L14 assume !(0 == __VERIFIER_assert_~cond); 2530#L14-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 2510#L71 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 2511#L64 havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~switch7; 2557#L62-1 call parse_expression_list_#t~mem4 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2556#L62-2 assume !!(0 != parse_expression_list_#t~mem4);havoc parse_expression_list_#t~mem4; 2554#L62-4 parse_expression_list_#t~post5 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post5;havoc parse_expression_list_#t~post5;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch7 := 0 == parse_expression_list_#t~mem6; 2552#L65 assume parse_expression_list_#t~switch7; 2513#L66-5 [2020-10-26 04:48:35,181 INFO L796 eck$LassoCheckResult]: Loop: 2513#L66-5 call parse_expression_list_#t~mem8 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short10 := 32 == parse_expression_list_#t~mem8; 2514#L66-1 assume parse_expression_list_#t~short10; 2543#L66-3 assume !!parse_expression_list_#t~short10;havoc parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem8;havoc parse_expression_list_#t~short10;parse_expression_list_#t~post11 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post11;havoc parse_expression_list_#t~post11; 2513#L66-5 [2020-10-26 04:48:35,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash -168608633, now seen corresponding path program 1 times [2020-10-26 04:48:35,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:35,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692674225] [2020-10-26 04:48:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 04:48:35,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692674225] [2020-10-26 04:48:35,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733420836] [2020-10-26 04:48:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:48:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:48:35,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-26 04:48:35,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:48:35,382 INFO L384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-26 04:48:35,384 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:48:35,389 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:48:35,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:48:35,390 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-10-26 04:48:35,443 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2020-10-26 04:48:35,444 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:48:35,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:48:35,458 INFO L545 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. [2020-10-26 04:48:35,459 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2020-10-26 04:48:35,529 INFO L384 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 10 [2020-10-26 04:48:35,530 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:48:35,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:48:35,537 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-26 04:48:35,537 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2020-10-26 04:48:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 04:48:35,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:48:35,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-26 04:48:35,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145033928] [2020-10-26 04:48:35,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:48:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:48:35,545 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2020-10-26 04:48:35,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:48:35,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172505878] [2020-10-26 04:48:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:48:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:35,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:48:35,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:48:35,553 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:48:35,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:48:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 04:48:35,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-26 04:48:35,607 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. cyclomatic complexity: 38 Second operand 9 states. [2020-10-26 04:48:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:48:35,846 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2020-10-26 04:48:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:48:35,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 82 transitions. [2020-10-26 04:48:35,847 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:48:35,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2020-10-26 04:48:35,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:48:35,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:48:35,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:48:35,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:48:35,847 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:48:35,847 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:48:35,847 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:48:35,847 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-26 04:48:35,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:48:35,848 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:48:35,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:48:35,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:48:35 BoogieIcfgContainer [2020-10-26 04:48:35,855 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:48:35,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:48:35,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:48:35,858 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:48:35,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:48:21" (3/4) ... [2020-10-26 04:48:35,863 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:48:35,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:48:35,865 INFO L168 Benchmark]: Toolchain (without parser) took 15282.21 ms. Allocated memory was 56.6 MB in the beginning and 176.2 MB in the end (delta: 119.5 MB). Free memory was 33.1 MB in the beginning and 63.7 MB in the end (delta: -30.5 MB). Peak memory consumption was 91.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,866 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 41.9 MB. Free memory was 21.6 MB in the beginning and 21.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:48:35,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.40 ms. Allocated memory is still 56.6 MB. Free memory was 32.5 MB in the beginning and 34.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.49 ms. Allocated memory is still 56.6 MB. Free memory was 34.3 MB in the beginning and 32.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,875 INFO L168 Benchmark]: Boogie Preprocessor took 69.54 ms. Allocated memory is still 56.6 MB. Free memory was 32.5 MB in the beginning and 31.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,876 INFO L168 Benchmark]: RCFGBuilder took 517.10 ms. Allocated memory is still 56.6 MB. Free memory was 31.0 MB in the beginning and 25.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,876 INFO L168 Benchmark]: BuchiAutomizer took 14241.23 ms. Allocated memory was 56.6 MB in the beginning and 176.2 MB in the end (delta: 119.5 MB). Free memory was 25.7 MB in the beginning and 63.7 MB in the end (delta: -38.0 MB). Peak memory consumption was 82.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:48:35,877 INFO L168 Benchmark]: Witness Printer took 5.67 ms. Allocated memory is still 176.2 MB. Free memory is still 63.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:48:35,883 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 41.9 MB. Free memory was 21.6 MB in the beginning and 21.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 385.40 ms. Allocated memory is still 56.6 MB. Free memory was 32.5 MB in the beginning and 34.3 MB in the end (delta: -1.8 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.49 ms. Allocated memory is still 56.6 MB. Free memory was 34.3 MB in the beginning and 32.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.54 ms. Allocated memory is still 56.6 MB. Free memory was 32.5 MB in the beginning and 31.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 517.10 ms. Allocated memory is still 56.6 MB. Free memory was 31.0 MB in the beginning and 25.9 MB in the end (delta: 5.1 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 14241.23 ms. Allocated memory was 56.6 MB in the beginning and 176.2 MB in the end (delta: 119.5 MB). Free memory was 25.7 MB in the beginning and 63.7 MB in the end (delta: -38.0 MB). Peak memory consumption was 82.6 MB. Max. memory is 16.1 GB. * Witness Printer took 5.67 ms. Allocated memory is still 176.2 MB. Free memory is still 63.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[A] + -1 * str + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * str + unknown-#length-unknown[A] + -1 * start and consists of 5 locations. One deterministic module has affine ranking function j and consists of 6 locations. 7 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 11.8s. Construction of modules took 0.8s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 237 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 313 SDtfs, 527 SDslu, 625 SDs, 0 SdLazy, 547 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI1 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax100 hnf100 lsp92 ukn63 mio100 lsp41 div100 bol100 ite100 ukn100 eq192 hnf85 smp100 dnf169 smp77 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms 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...