./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -s /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:55:44,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:55:44,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:55:44,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:55:44,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:55:44,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:55:44,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:55:44,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:55:44,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:55:44,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:55:44,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:55:44,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:55:44,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:55:44,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:55:44,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:55:44,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:55:44,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:55:44,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:55:44,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:55:44,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:55:44,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:55:44,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:55:44,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:55:44,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:55:44,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:55:44,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:55:44,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:55:44,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:55:44,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:55:44,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:55:44,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:55:44,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:55:44,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:55:44,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:55:44,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:55:44,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:55:44,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:55:44,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:55:44,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:55:44,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:55:44,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:55:44,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 11:55:44,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:55:44,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:55:44,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:55:44,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:55:44,886 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:55:44,886 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 11:55:44,887 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 11:55:44,887 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 11:55:44,887 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 11:55:44,887 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 11:55:44,887 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 11:55:44,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:55:44,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:55:44,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:55:44,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:55:44,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:55:44,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:55:44,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 11:55:44,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 11:55:44,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 11:55:44,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:55:44,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:55:44,890 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 11:55:44,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:55:44,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 11:55:44,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:55:44,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:55:44,890 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 11:55:44,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:55:44,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:55:44,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:55:44,891 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 11:55:44,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 11:55:44,892 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2019-12-07 11:55:44,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:55:45,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:55:45,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:55:45,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:55:45,005 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:55:45,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-12-07 11:55:45,045 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/data/728d881b7/203ebbb0e46f4c709c9035515ea343b6/FLAGbe7cd3915 [2019-12-07 11:55:45,366 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:55:45,367 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-12-07 11:55:45,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/data/728d881b7/203ebbb0e46f4c709c9035515ea343b6/FLAGbe7cd3915 [2019-12-07 11:55:45,380 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/data/728d881b7/203ebbb0e46f4c709c9035515ea343b6 [2019-12-07 11:55:45,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:55:45,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:55:45,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:55:45,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:55:45,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:55:45,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3266040e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45, skipping insertion in model container [2019-12-07 11:55:45,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:55:45,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:55:45,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:55:45,563 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:55:45,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:55:45,604 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:55:45,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45 WrapperNode [2019-12-07 11:55:45,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:55:45,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:55:45,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:55:45,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:55:45,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:55:45,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:55:45,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:55:45,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:55:45,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... [2019-12-07 11:55:45,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:55:45,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:55:45,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:55:45,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:55:45,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:55:45,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:55:45,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:55:45,941 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:55:45,941 INFO L287 CfgBuilder]: Removed 14 assume(true) statements. [2019-12-07 11:55:45,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:45 BoogieIcfgContainer [2019-12-07 11:55:45,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:55:45,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 11:55:45,943 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 11:55:45,946 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 11:55:45,946 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:55:45,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 11:55:45" (1/3) ... [2019-12-07 11:55:45,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c2cae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:55:45, skipping insertion in model container [2019-12-07 11:55:45,947 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:55:45,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:45" (2/3) ... [2019-12-07 11:55:45,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c2cae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:55:45, skipping insertion in model container [2019-12-07 11:55:45,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:55:45,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:45" (3/3) ... [2019-12-07 11:55:45,949 INFO L371 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-12-07 11:55:45,978 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 11:55:45,978 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 11:55:45,978 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 11:55:45,978 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:55:45,978 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:55:45,978 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 11:55:45,978 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:55:45,978 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 11:55:45,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-12-07 11:55:46,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-12-07 11:55:46,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:46,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:46,006 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 11:55:46,006 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:55:46,006 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 11:55:46,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-12-07 11:55:46,008 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-12-07 11:55:46,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:46,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:46,008 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 11:55:46,008 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:55:46,013 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 31#L79-3true [2019-12-07 11:55:46,013 INFO L796 eck$LassoCheckResult]: Loop: 31#L79-3true assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 36#L79-2true main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 31#L79-3true [2019-12-07 11:55:46,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 11:55:46,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977649669] [2019-12-07 11:55:46,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 11:55:46,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528126356] [2019-12-07 11:55:46,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 11:55:46,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107081807] [2019-12-07 11:55:46,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:46,240 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:55:46,241 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:55:46,241 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:55:46,241 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:55:46,241 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:55:46,241 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,241 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:55:46,241 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:55:46,241 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-12-07 11:55:46,241 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:55:46,241 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:55:46,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:46,378 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:55:46,381 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,385 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 [2019-12-07 11:55:46,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:46,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:46,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:46,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,395 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 [2019-12-07 11:55:46,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:46,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:46,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:46,406 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 [2019-12-07 11:55:46,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:46,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:46,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:46,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:46,414 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 [2019-12-07 11:55:46,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:46,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:46,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,425 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 [2019-12-07 11:55:46,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:46,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:46,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:46,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,433 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 [2019-12-07 11:55:46,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:46,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:46,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:46,444 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 [2019-12-07 11:55:46,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:46,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:46,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:46,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:46,452 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 [2019-12-07 11:55:46,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:46,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:46,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:46,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:46,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:46,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:46,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:55:46,483 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-12-07 11:55:46,483 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:46,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:55:46,489 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:55:46,490 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:55:46,490 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1, ULTIMATE.start_main_~i~1) = 15*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_1 - 2*ULTIMATE.start_main_~i~1 Supporting invariants [] [2019-12-07 11:55:46,496 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 11:55:46,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:55:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:55:46,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,536 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:55:46,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,567 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 11:55:46,567 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-12-07 11:55:46,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 102 states and 153 transitions. Complement of second has 8 states. [2019-12-07 11:55:46,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 11:55:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:55:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2019-12-07 11:55:46,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 11:55:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 11:55:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:46,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 11:55:46,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:46,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2019-12-07 11:55:46,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2019-12-07 11:55:46,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-12-07 11:55:46,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:46,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-12-07 11:55:46,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:46,666 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-12-07 11:55:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-12-07 11:55:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 11:55:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 11:55:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-12-07 11:55:46,684 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-12-07 11:55:46,684 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-12-07 11:55:46,684 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 11:55:46,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-12-07 11:55:46,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:46,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:46,685 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:46,686 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:46,686 INFO L794 eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 193#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 194#L79-3 assume !(main_~i~1 < 8); 209#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 189#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 190#L52-4 [2019-12-07 11:55:46,686 INFO L796 eck$LassoCheckResult]: Loop: 190#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 203#L55 assume !parse_expression_list_#t~switch4; 198#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 199#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 205#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 190#L52-4 [2019-12-07 11:55:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-12-07 11:55:46,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508532946] [2019-12-07 11:55:46,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508532946] [2019-12-07 11:55:46,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:46,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:55:46,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584153314] [2019-12-07 11:55:46,717 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,717 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2019-12-07 11:55:46,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590097503] [2019-12-07 11:55:46,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:46,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:46,781 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-12-07 11:55:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:46,791 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-12-07 11:55:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:46,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-12-07 11:55:46,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-12-07 11:55:46,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:46,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:46,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-12-07 11:55:46,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:46,795 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-12-07 11:55:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-12-07 11:55:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-12-07 11:55:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 11:55:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-12-07 11:55:46,799 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-12-07 11:55:46,799 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-12-07 11:55:46,799 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 11:55:46,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-12-07 11:55:46,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:46,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:46,800 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:46,800 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:46,801 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 264#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 265#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 281#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 282#L79-3 assume !(main_~i~1 < 8); 280#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 258#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 259#L52-4 [2019-12-07 11:55:46,801 INFO L796 eck$LassoCheckResult]: Loop: 259#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 274#L55 assume !parse_expression_list_#t~switch4; 269#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 270#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 275#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 259#L52-4 [2019-12-07 11:55:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2019-12-07 11:55:46,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748307158] [2019-12-07 11:55:46,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748307158] [2019-12-07 11:55:46,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490576236] [2019-12-07 11:55:46,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:55:46,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:46,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 11:55:46,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173240818] [2019-12-07 11:55:46,869 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2019-12-07 11:55:46,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130202360] [2019-12-07 11:55:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:46,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:46,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:46,916 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-12-07 11:55:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:46,929 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-12-07 11:55:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:55:46,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-12-07 11:55:46,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2019-12-07 11:55:46,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:46,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:46,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-12-07 11:55:46,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:46,931 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-12-07 11:55:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-12-07 11:55:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-12-07 11:55:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 11:55:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-12-07 11:55:46,934 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-12-07 11:55:46,934 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-12-07 11:55:46,934 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 11:55:46,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-12-07 11:55:46,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:46,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:46,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:46,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-12-07 11:55:46,935 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:46,935 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 357#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 358#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 374#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 375#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 376#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 380#L79-3 assume !(main_~i~1 < 8); 373#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 351#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 352#L52-4 [2019-12-07 11:55:46,935 INFO L796 eck$LassoCheckResult]: Loop: 352#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 367#L55 assume !parse_expression_list_#t~switch4; 362#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 363#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 368#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 352#L52-4 [2019-12-07 11:55:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,936 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2019-12-07 11:55:46,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416266513] [2019-12-07 11:55:46,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416266513] [2019-12-07 11:55:46,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709066603] [2019-12-07 11:55:46,965 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:46,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:55:46,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:55:46,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:55:46,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 11:55:47,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136097559] [2019-12-07 11:55:47,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2019-12-07 11:55:47,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320563929] [2019-12-07 11:55:47,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:55:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:55:47,055 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-12-07 11:55:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,070 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-12-07 11:55:47,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:55:47,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-12-07 11:55:47,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-12-07 11:55:47,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-12-07 11:55:47,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,072 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-12-07 11:55:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-12-07 11:55:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-12-07 11:55:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 11:55:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-12-07 11:55:47,074 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-12-07 11:55:47,074 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-12-07 11:55:47,074 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 11:55:47,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-12-07 11:55:47,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,075 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,075 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,076 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 461#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 462#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 478#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 484#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 486#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 479#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 480#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 485#L79-3 assume !(main_~i~1 < 8); 477#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 455#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 456#L52-4 [2019-12-07 11:55:47,076 INFO L796 eck$LassoCheckResult]: Loop: 456#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 471#L55 assume !parse_expression_list_#t~switch4; 466#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 467#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 472#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 456#L52-4 [2019-12-07 11:55:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2019-12-07 11:55:47,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884166690] [2019-12-07 11:55:47,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884166690] [2019-12-07 11:55:47,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918120124] [2019-12-07 11:55:47,107 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:47,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 11:55:47,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:55:47,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:55:47,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 11:55:47,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308018553] [2019-12-07 11:55:47,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2019-12-07 11:55:47,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677332322] [2019-12-07 11:55:47,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,153 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:55:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:55:47,200 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-12-07 11:55:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,214 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-12-07 11:55:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:55:47,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-12-07 11:55:47,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-12-07 11:55:47,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-12-07 11:55:47,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,216 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-12-07 11:55:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-12-07 11:55:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-12-07 11:55:47,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:55:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-12-07 11:55:47,218 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-12-07 11:55:47,218 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-12-07 11:55:47,218 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 11:55:47,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-12-07 11:55:47,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,219 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,219 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,219 INFO L794 eck$LassoCheckResult]: Stem: 591#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 577#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 593#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 594#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 595#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 603#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 602#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 601#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 600#L79-3 assume !(main_~i~1 < 8); 592#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 570#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 571#L52-4 [2019-12-07 11:55:47,219 INFO L796 eck$LassoCheckResult]: Loop: 571#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 586#L55 assume !parse_expression_list_#t~switch4; 581#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 582#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 587#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 571#L52-4 [2019-12-07 11:55:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,219 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2019-12-07 11:55:47,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407237922] [2019-12-07 11:55:47,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407237922] [2019-12-07 11:55:47,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688320917] [2019-12-07 11:55:47,251 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:47,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:55:47,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:55:47,277 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:55:47,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 11:55:47,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82112771] [2019-12-07 11:55:47,284 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2019-12-07 11:55:47,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830986642] [2019-12-07 11:55:47,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:55:47,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:55:47,322 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-12-07 11:55:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,335 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-12-07 11:55:47,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:55:47,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-12-07 11:55:47,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-12-07 11:55:47,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-12-07 11:55:47,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,338 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-12-07 11:55:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-12-07 11:55:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-12-07 11:55:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 11:55:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-12-07 11:55:47,341 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-12-07 11:55:47,341 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-12-07 11:55:47,341 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 11:55:47,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-12-07 11:55:47,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,342 INFO L794 eck$LassoCheckResult]: Stem: 717#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 702#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 703#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 719#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 720#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 721#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 725#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 731#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 730#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 729#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 728#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 727#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 726#L79-3 assume !(main_~i~1 < 8); 718#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 696#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 697#L52-4 [2019-12-07 11:55:47,342 INFO L796 eck$LassoCheckResult]: Loop: 697#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 712#L55 assume !parse_expression_list_#t~switch4; 707#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 708#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 713#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 697#L52-4 [2019-12-07 11:55:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2019-12-07 11:55:47,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993314081] [2019-12-07 11:55:47,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993314081] [2019-12-07 11:55:47,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942933474] [2019-12-07 11:55:47,387 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:47,426 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 11:55:47,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:55:47,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 11:55:47,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 11:55:47,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809856001] [2019-12-07 11:55:47,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,435 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2019-12-07 11:55:47,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934979236] [2019-12-07 11:55:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:55:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:55:47,481 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-12-07 11:55:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,499 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-12-07 11:55:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:55:47,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2019-12-07 11:55:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2019-12-07 11:55:47,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-12-07 11:55:47,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,501 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-12-07 11:55:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-12-07 11:55:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-12-07 11:55:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 11:55:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-12-07 11:55:47,503 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-12-07 11:55:47,504 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-12-07 11:55:47,504 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 11:55:47,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-12-07 11:55:47,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,505 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 839#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 840#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 856#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 857#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 858#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 862#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 869#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 867#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 865#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 863#L79-3 assume !(main_~i~1 < 8); 855#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 833#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 834#L52-4 [2019-12-07 11:55:47,505 INFO L796 eck$LassoCheckResult]: Loop: 834#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 849#L55 assume !parse_expression_list_#t~switch4; 844#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 845#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 850#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 834#L52-4 [2019-12-07 11:55:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2019-12-07 11:55:47,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279865155] [2019-12-07 11:55:47,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279865155] [2019-12-07 11:55:47,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418501031] [2019-12-07 11:55:47,549 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:47,584 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 11:55:47,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:55:47,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:55:47,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-07 11:55:47,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599097282] [2019-12-07 11:55:47,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2019-12-07 11:55:47,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289783227] [2019-12-07 11:55:47,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,600 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:55:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:55:47,629 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-12-07 11:55:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,646 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-12-07 11:55:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:55:47,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-12-07 11:55:47,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-12-07 11:55:47,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-12-07 11:55:47,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,648 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-12-07 11:55:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-12-07 11:55:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-12-07 11:55:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 11:55:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-12-07 11:55:47,651 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-12-07 11:55:47,651 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-12-07 11:55:47,651 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 11:55:47,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-12-07 11:55:47,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,652 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 987#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 988#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1004#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1005#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1006#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1010#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1020#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1019#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1018#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1017#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1016#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1015#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1014#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1013#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1012#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1011#L79-3 assume !(main_~i~1 < 8); 1003#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 983#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 984#L52-4 [2019-12-07 11:55:47,652 INFO L796 eck$LassoCheckResult]: Loop: 984#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 997#L55 assume !parse_expression_list_#t~switch4; 992#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 993#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 999#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 984#L52-4 [2019-12-07 11:55:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2019-12-07 11:55:47,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195537480] [2019-12-07 11:55:47,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195537480] [2019-12-07 11:55:47,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71672606] [2019-12-07 11:55:47,710 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:55:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:55:47,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:55:47,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-07 11:55:47,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351804308] [2019-12-07 11:55:47,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:55:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2019-12-07 11:55:47,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132821666] [2019-12-07 11:55:47,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:55:47,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:55:47,800 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-12-07 11:55:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,819 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-12-07 11:55:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:55:47,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-12-07 11:55:47,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-12-07 11:55:47,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:55:47,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:55:47,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-12-07 11:55:47,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:55:47,821 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 11:55:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-12-07 11:55:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 11:55:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 11:55:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-12-07 11:55:47,823 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 11:55:47,823 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-12-07 11:55:47,823 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 11:55:47,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2019-12-07 11:55:47,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-12-07 11:55:47,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:47,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:47,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,824 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:47,824 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1145#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1146#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1162#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1163#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1164#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1168#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1179#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1178#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1177#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1176#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1175#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1174#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1173#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1172#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1171#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1170#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1169#L79-3 assume !(main_~i~1 < 8); 1161#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1139#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1140#L52-4 [2019-12-07 11:55:47,824 INFO L796 eck$LassoCheckResult]: Loop: 1140#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1155#L55 assume !parse_expression_list_#t~switch4; 1150#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1151#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1156#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1140#L52-4 [2019-12-07 11:55:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2019-12-07 11:55:47,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424346421] [2019-12-07 11:55:47,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2019-12-07 11:55:47,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609558133] [2019-12-07 11:55:47,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2019-12-07 11:55:47,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125894851] [2019-12-07 11:55:47,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:47,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:52,132 WARN L192 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 194 DAG size of output: 146 [2019-12-07 11:55:52,330 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 11:55:52,332 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:55:52,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:55:52,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:55:52,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:55:52,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:55:52,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:55:52,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:55:52,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2019-12-07 11:55:52,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:55:52,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:55:52,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:55:52,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:55:52,638 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,641 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 [2019-12-07 11:55:52,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,650 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 [2019-12-07 11:55:52,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,657 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 [2019-12-07 11:55:52,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,664 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 [2019-12-07 11:55:52,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,673 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 [2019-12-07 11:55:52,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,680 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 [2019-12-07 11:55:52,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,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 [2019-12-07 11:55:52,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,697 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 [2019-12-07 11:55:52,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,707 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 [2019-12-07 11:55:52,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,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 [2019-12-07 11:55:52,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,723 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 [2019-12-07 11:55:52,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:55:52,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:55:52,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:55:52,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,730 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 [2019-12-07 11:55:52,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:55:52,739 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 [2019-12-07 11:55:52,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,748 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 [2019-12-07 11:55:52,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,759 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 [2019-12-07 11:55:52,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,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 [2019-12-07 11:55:52,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,784 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 [2019-12-07 11:55:52,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:55:52,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:55:52,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:55:52,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:55:52,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:55:52,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:55:52,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:55:52,818 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 11:55:52,818 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:55:52,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:55:52,823 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:55:52,823 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:55:52,823 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1, ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~i~0) = 1*v_rep(select #length ULTIMATE.start_parse_expression_list_~str.base)_1 - 1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~i~0 Supporting invariants [] [2019-12-07 11:55:52,837 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-12-07 11:55:52,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:55:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:52,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:55:52,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:52,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:55:52,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:55:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:52,871 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 11:55:52,871 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-12-07 11:55:52,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 73 states and 92 transitions. Complement of second has 4 states. [2019-12-07 11:55:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 11:55:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:55:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2019-12-07 11:55:52,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2019-12-07 11:55:52,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:52,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2019-12-07 11:55:52,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:52,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2019-12-07 11:55:52,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:55:52,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2019-12-07 11:55:52,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:55:52,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2019-12-07 11:55:52,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 11:55:52,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 11:55:52,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2019-12-07 11:55:52,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:55:52,899 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-12-07 11:55:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2019-12-07 11:55:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-12-07 11:55:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 11:55:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-12-07 11:55:52,901 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-12-07 11:55:52,901 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-12-07 11:55:52,901 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 11:55:52,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2019-12-07 11:55:52,902 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:55:52,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:52,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:52,902 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:52,902 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:55:52,902 INFO L794 eck$LassoCheckResult]: Stem: 1411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1388#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1389#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1413#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1414#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1415#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1433#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1432#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1431#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1430#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1429#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1427#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1425#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1424#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1423#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1422#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1421#L79-3 assume !(main_~i~1 < 8); 1412#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1380#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1381#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1404#L55 assume parse_expression_list_#t~switch4; 1392#L56-5 [2019-12-07 11:55:52,902 INFO L796 eck$LassoCheckResult]: Loop: 1392#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1398#L56-1 assume parse_expression_list_#t~short7; 1390#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1392#L56-5 [2019-12-07 11:55:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2019-12-07 11:55:52,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:52,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581717876] [2019-12-07 11:55:52,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:52,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2019-12-07 11:55:52,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:52,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123811941] [2019-12-07 11:55:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:52,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2019-12-07 11:55:52,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:52,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827164119] [2019-12-07 11:55:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:55:53,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827164119] [2019-12-07 11:55:53,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:53,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:55:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195942124] [2019-12-07 11:55:53,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:55:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:55:53,089 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2019-12-07 11:55:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:53,194 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-12-07 11:55:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:55:53,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2019-12-07 11:55:53,195 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-12-07 11:55:53,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2019-12-07 11:55:53,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 11:55:53,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-12-07 11:55:53,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2019-12-07 11:55:53,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:55:53,196 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-12-07 11:55:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2019-12-07 11:55:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-12-07 11:55:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 11:55:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-12-07 11:55:53,199 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-12-07 11:55:53,199 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-12-07 11:55:53,200 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 11:55:53,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2019-12-07 11:55:53,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:55:53,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:55:53,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:55:53,201 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:53,201 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:55:53,201 INFO L794 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1557#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1558#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1584#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1585#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1586#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1605#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1604#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1603#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1602#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1601#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1600#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1599#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1598#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1597#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1596#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1595#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1594#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1593#L79-3 assume !(main_~i~1 < 8); 1583#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1549#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1550#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1571#L55 assume !parse_expression_list_#t~switch4; 1563#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 1564#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 1574#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 1572#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1573#L55 assume parse_expression_list_#t~switch4; 1578#L56-5 [2019-12-07 11:55:53,201 INFO L796 eck$LassoCheckResult]: Loop: 1578#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1579#L56-1 assume parse_expression_list_#t~short7; 1609#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 1578#L56-5 [2019-12-07 11:55:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2019-12-07 11:55:53,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:53,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988779686] [2019-12-07 11:55:53,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:53,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2019-12-07 11:55:53,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:53,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304282968] [2019-12-07 11:55:53,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2019-12-07 11:55:53,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:53,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892652012] [2019-12-07 11:55:53,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:55:53,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:55:59,905 WARN L192 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 236 DAG size of output: 170 [2019-12-07 11:56:00,194 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 11:56:00,196 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:56:00,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:56:00,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:56:00,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:56:00,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:56:00,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:56:00,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:56:00,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2019-12-07 11:56:00,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:56:00,196 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:56:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:00,560 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:56:00,560 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,563 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 [2019-12-07 11:56:00,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,571 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 [2019-12-07 11:56:00,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,579 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 [2019-12-07 11:56:00,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,587 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 [2019-12-07 11:56:00,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,593 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 [2019-12-07 11:56:00,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,599 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 [2019-12-07 11:56:00,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,605 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 [2019-12-07 11:56:00,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,612 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 [2019-12-07 11:56:00,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,622 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 [2019-12-07 11:56:00,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:00,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:00,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:00,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,636 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 [2019-12-07 11:56:00,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,646 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 [2019-12-07 11:56:00,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,654 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 [2019-12-07 11:56:00,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/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 [2019-12-07 11:56:00,664 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 [2019-12-07 11:56:00,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,673 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 [2019-12-07 11:56:00,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,683 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 [2019-12-07 11:56:00,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,692 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 [2019-12-07 11:56:00,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,704 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 [2019-12-07 11:56:00,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:00,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:00,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:00,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:00,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:00,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:00,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:56:00,739 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-12-07 11:56:00,739 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:00,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:56:00,744 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:56:00,744 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:56:00,744 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, ULTIMATE.start_parse_expression_list_~start~0, v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3) = -1*ULTIMATE.start_parse_expression_list_~str.offset - 1*ULTIMATE.start_parse_expression_list_~start~0 + 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3 Supporting invariants [] [2019-12-07 11:56:00,764 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-12-07 11:56:00,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:56:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:00,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:56:00,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:00,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:56:00,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:00,810 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 [2019-12-07 11:56:00,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-12-07 11:56:00,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 176 states and 237 transitions. Complement of second has 8 states. [2019-12-07 11:56:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 11:56:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 11:56:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-12-07 11:56:00,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2019-12-07 11:56:00,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:00,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2019-12-07 11:56:00,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:00,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2019-12-07 11:56:00,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:00,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2019-12-07 11:56:00,868 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-12-07 11:56:00,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2019-12-07 11:56:00,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-12-07 11:56:00,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-12-07 11:56:00,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2019-12-07 11:56:00,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:00,870 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-12-07 11:56:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2019-12-07 11:56:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-12-07 11:56:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 11:56:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2019-12-07 11:56:00,874 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-12-07 11:56:00,874 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-12-07 11:56:00,875 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 11:56:00,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2019-12-07 11:56:00,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:00,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:00,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:00,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:00,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:56:00,877 INFO L794 eck$LassoCheckResult]: Stem: 1981#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1950#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 1951#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1983#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1984#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1985#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2006#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2005#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2004#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2003#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2002#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2001#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2000#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1999#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1998#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1997#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1996#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 1995#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 1994#L79-3 assume !(main_~i~1 < 8); 1982#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 1946#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 1947#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 1964#L55 assume parse_expression_list_#t~switch4; 1973#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 1974#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2028#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2024#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2027#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 1988#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 1942#L59-8 [2019-12-07 11:56:00,877 INFO L796 eck$LassoCheckResult]: Loop: 1942#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 1943#L59-1 assume !parse_expression_list_#t~short14; 1960#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 1942#L59-8 [2019-12-07 11:56:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2019-12-07 11:56:00,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:00,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457014134] [2019-12-07 11:56:00,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:01,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457014134] [2019-12-07 11:56:01,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:01,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:01,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490470152] [2019-12-07 11:56:01,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:56:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2019-12-07 11:56:01,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140439421] [2019-12-07 11:56:01,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:01,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140439421] [2019-12-07 11:56:01,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:01,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:01,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433295943] [2019-12-07 11:56:01,057 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 11:56:01,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:01,058 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-12-07 11:56:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:01,065 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-12-07 11:56:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:01,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2019-12-07 11:56:01,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:01,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2019-12-07 11:56:01,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 11:56:01,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-12-07 11:56:01,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2019-12-07 11:56:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:01,067 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-12-07 11:56:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2019-12-07 11:56:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-07 11:56:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 11:56:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2019-12-07 11:56:01,069 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-12-07 11:56:01,069 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-12-07 11:56:01,069 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 11:56:01,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2019-12-07 11:56:01,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:01,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:01,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:01,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:01,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:01,071 INFO L794 eck$LassoCheckResult]: Stem: 2178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2146#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2147#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2180#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2181#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2182#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2225#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2224#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2223#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2222#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2221#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2220#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2218#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2217#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2216#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2215#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2214#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2213#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2212#L79-3 assume !(main_~i~1 < 8); 2179#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2138#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2139#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2161#L55 assume parse_expression_list_#t~switch4; 2206#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2155#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2148#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2149#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2165#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2183#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2140#L59-8 [2019-12-07 11:56:01,071 INFO L796 eck$LassoCheckResult]: Loop: 2140#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2141#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2158#L59-2 assume parse_expression_list_#t~short13; 2185#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2177#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2140#L59-8 [2019-12-07 11:56:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2019-12-07 11:56:01,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328007688] [2019-12-07 11:56:01,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,095 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2019-12-07 11:56:01,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746621633] [2019-12-07 11:56:01,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,100 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2019-12-07 11:56:01,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919106904] [2019-12-07 11:56:01,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:01,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919106904] [2019-12-07 11:56:01,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:01,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:56:01,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85830486] [2019-12-07 11:56:01,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:01,173 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2019-12-07 11:56:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:01,224 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2019-12-07 11:56:01,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:56:01,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2019-12-07 11:56:01,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:56:01,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2019-12-07 11:56:01,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-12-07 11:56:01,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-12-07 11:56:01,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2019-12-07 11:56:01,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:01,226 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2019-12-07 11:56:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2019-12-07 11:56:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2019-12-07 11:56:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 11:56:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-12-07 11:56:01,228 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-12-07 11:56:01,228 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-12-07 11:56:01,229 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 11:56:01,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2019-12-07 11:56:01,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:01,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:01,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:01,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:01,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:01,230 INFO L794 eck$LassoCheckResult]: Stem: 2424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2398#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2399#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2426#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2427#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2428#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2462#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2461#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2460#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2459#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2458#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2457#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2456#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2455#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2454#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2453#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2452#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2451#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2450#L79-3 assume !(main_~i~1 < 8); 2425#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2394#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2395#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2413#L55 assume !parse_expression_list_#t~switch4; 2449#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2481#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2480#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2473#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2470#L55 assume parse_expression_list_#t~switch4; 2466#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2465#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2400#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2401#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2435#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 2429#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2390#L59-8 [2019-12-07 11:56:01,230 INFO L796 eck$LassoCheckResult]: Loop: 2390#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2391#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2410#L59-2 assume parse_expression_list_#t~short13; 2431#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2423#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2390#L59-8 [2019-12-07 11:56:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2019-12-07 11:56:01,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566695358] [2019-12-07 11:56:01,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2019-12-07 11:56:01,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835580957] [2019-12-07 11:56:01,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2019-12-07 11:56:01,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465733474] [2019-12-07 11:56:01,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:01,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465733474] [2019-12-07 11:56:01,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200219504] [2019-12-07 11:56:01,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:56:01,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:01,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:56:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:01,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:56:01,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-07 11:56:01,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084514577] [2019-12-07 11:56:01,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:56:01,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:01,369 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-12-07 11:56:01,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:01,442 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2019-12-07 11:56:01,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:56:01,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2019-12-07 11:56:01,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:56:01,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2019-12-07 11:56:01,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-12-07 11:56:01,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-12-07 11:56:01,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2019-12-07 11:56:01,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:01,445 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2019-12-07 11:56:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2019-12-07 11:56:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-12-07 11:56:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 11:56:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2019-12-07 11:56:01,448 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-12-07 11:56:01,448 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-12-07 11:56:01,448 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-12-07 11:56:01,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2019-12-07 11:56:01,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:56:01,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:01,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:01,450 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:01,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-12-07 11:56:01,450 INFO L794 eck$LassoCheckResult]: Stem: 2842#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2816#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 2817#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2844#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2845#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2846#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2856#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2872#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2871#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2870#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2869#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2868#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2867#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2866#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2865#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2864#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2863#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 2862#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 2861#L79-3 assume !(main_~i~1 < 8); 2843#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 2808#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 2809#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2830#L55 assume !parse_expression_list_#t~switch4; 2923#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2927#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2926#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2925#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2922#L55 assume !parse_expression_list_#t~switch4; 2917#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 2939#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 2938#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 2921#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 2916#L55 assume parse_expression_list_#t~switch4; 2912#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 2906#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 2902#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 2900#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 2896#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 2849#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 2810#L59-8 [2019-12-07 11:56:01,450 INFO L796 eck$LassoCheckResult]: Loop: 2810#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 2811#L59-1 assume parse_expression_list_#t~short14;call parse_expression_list_#t~mem11 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short13 := 32 == parse_expression_list_#t~mem11; 2827#L59-2 assume parse_expression_list_#t~short13; 2852#L59-4 parse_expression_list_#t~short14 := parse_expression_list_#t~short13; 2841#L59-6 assume !!parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14;parse_expression_list_#t~post15 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post15 - 1;havoc parse_expression_list_#t~post15; 2810#L59-8 [2019-12-07 11:56:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2019-12-07 11:56:01,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766752051] [2019-12-07 11:56:01,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2019-12-07 11:56:01,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942248197] [2019-12-07 11:56:01,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,474 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2019-12-07 11:56:01,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779963873] [2019-12-07 11:56:01,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:01,496 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:08,274 WARN L192 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 291 DAG size of output: 200 [2019-12-07 11:56:08,539 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 11:56:08,541 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:56:08,541 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:56:08,541 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:56:08,541 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:56:08,542 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:56:08,542 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,542 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:56:08,542 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:56:08,542 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration16_Lasso [2019-12-07 11:56:08,542 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:56:08,542 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:56:08,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:56:08,914 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:56:08,915 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,917 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 [2019-12-07 11:56:08,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,923 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 [2019-12-07 11:56:08,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,929 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 [2019-12-07 11:56:08,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,936 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 [2019-12-07 11:56:08,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:08,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:08,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,949 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 [2019-12-07 11:56:08,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,955 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 [2019-12-07 11:56:08,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,963 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 [2019-12-07 11:56:08,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,969 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 [2019-12-07 11:56:08,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,975 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 [2019-12-07 11:56:08,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,983 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 [2019-12-07 11:56:08,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:08,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:08,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,991 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 [2019-12-07 11:56:08,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:08,997 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 [2019-12-07 11:56:08,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:08,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:08,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:08,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:08,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:08,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:08,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:08,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,003 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 [2019-12-07 11:56:09,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:09,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:09,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:09,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,009 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 [2019-12-07 11:56:09,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:09,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,017 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 [2019-12-07 11:56:09,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:09,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:09,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:09,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,023 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 [2019-12-07 11:56:09,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:56:09,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:56:09,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:56:09,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,029 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 [2019-12-07 11:56:09,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:09,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,037 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 [2019-12-07 11:56:09,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:09,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,046 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 [2019-12-07 11:56:09,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:09,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,055 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 [2019-12-07 11:56:09,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,056 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-12-07 11:56:09,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,057 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-12-07 11:56:09,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,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 [2019-12-07 11:56:09,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:56:09,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:56:09,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:56:09,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:56:09,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:56:09,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:56:09,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:56:09,093 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-12-07 11:56:09,093 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:56:09,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:56:09,097 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:56:09,097 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:56:09,097 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 [] [2019-12-07 11:56:09,119 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-12-07 11:56:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:56:09,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:56:09,153 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:09,171 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-12-07 11:56:09,171 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2019-12-07 11:56:09,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51. Second operand 4 states. Result 296 states and 391 transitions. Complement of second has 11 states. [2019-12-07 11:56:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-12-07 11:56:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 11:56:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2019-12-07 11:56:09,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2019-12-07 11:56:09,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:09,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2019-12-07 11:56:09,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:09,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2019-12-07 11:56:09,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:56:09,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2019-12-07 11:56:09,235 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-12-07 11:56:09,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2019-12-07 11:56:09,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-12-07 11:56:09,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-12-07 11:56:09,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2019-12-07 11:56:09,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:09,246 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2019-12-07 11:56:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2019-12-07 11:56:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2019-12-07 11:56:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 11:56:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2019-12-07 11:56:09,248 INFO L711 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-12-07 11:56:09,248 INFO L591 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-12-07 11:56:09,248 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-12-07 11:56:09,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2019-12-07 11:56:09,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:56:09,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:09,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:09,249 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:09,249 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:56:09,250 INFO L794 eck$LassoCheckResult]: Stem: 3473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3449#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3450#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3475#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3476#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3477#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3498#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3497#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3496#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3495#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3494#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3493#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3492#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3491#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3490#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3489#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3488#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3487#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3486#L79-3 assume !(main_~i~1 < 8); 3474#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 3441#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3442#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3461#L55 assume parse_expression_list_#t~switch4; 3534#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3568#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 3570#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 3569#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3560#L57 assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; 3559#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3558#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3557#L59-1 assume !parse_expression_list_#t~short14; 3556#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 3555#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3554#L60 assume !parse_expression_list_#t~short17; 3553#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3552#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3551#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 3550#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3549#L4 assume !(0 == __VERIFIER_assert_~cond); 3548#L4-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 3547#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3546#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 3545#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3544#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3543#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3542#L55 assume parse_expression_list_#t~switch4; 3452#L56-5 [2019-12-07 11:56:09,250 INFO L796 eck$LassoCheckResult]: Loop: 3452#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3457#L56-1 assume parse_expression_list_#t~short7; 3451#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3452#L56-5 [2019-12-07 11:56:09,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -207736402, now seen corresponding path program 1 times [2019-12-07 11:56:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71966471] [2019-12-07 11:56:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:09,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71966471] [2019-12-07 11:56:09,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:09,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:09,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819175440] [2019-12-07 11:56:09,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:56:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,308 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2019-12-07 11:56:09,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167562187] [2019-12-07 11:56:09,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:09,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:56:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:56:09,340 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 8 states. [2019-12-07 11:56:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:09,512 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2019-12-07 11:56:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:56:09,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 304 transitions. [2019-12-07 11:56:09,514 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-12-07 11:56:09,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 196 states and 252 transitions. [2019-12-07 11:56:09,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-12-07 11:56:09,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-12-07 11:56:09,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 252 transitions. [2019-12-07 11:56:09,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:09,516 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 252 transitions. [2019-12-07 11:56:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 252 transitions. [2019-12-07 11:56:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 167. [2019-12-07 11:56:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 11:56:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2019-12-07 11:56:09,520 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-12-07 11:56:09,520 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-12-07 11:56:09,520 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-12-07 11:56:09,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 214 transitions. [2019-12-07 11:56:09,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-12-07 11:56:09,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:09,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:09,522 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:09,522 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:56:09,522 INFO L794 eck$LassoCheckResult]: Stem: 3877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3848#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 3849#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3879#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3880#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3881#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3906#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3905#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3904#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3903#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3902#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3901#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3900#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3899#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3898#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3897#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3896#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 3895#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 3894#L79-3 assume !(main_~i~1 < 8); 3878#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 3840#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 3841#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3863#L55 assume parse_expression_list_#t~switch4; 3935#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3934#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 3933#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 3932#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 3931#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 3930#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 3929#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 3928#L59-1 assume !parse_expression_list_#t~short14; 3927#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 3926#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 3925#L60 assume !parse_expression_list_#t~short17; 3924#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 3923#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 3922#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 3921#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 3920#L4 assume !(0 == __VERIFIER_assert_~cond); 3919#L4-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 3918#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 3917#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 3916#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 3915#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 3914#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 3912#L55 assume parse_expression_list_#t~switch4; 3851#L56-5 [2019-12-07 11:56:09,522 INFO L796 eck$LassoCheckResult]: Loop: 3851#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 3857#L56-1 assume parse_expression_list_#t~short7; 3850#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 3851#L56-5 [2019-12-07 11:56:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2019-12-07 11:56:09,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256935358] [2019-12-07 11:56:09,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:56:09,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256935358] [2019-12-07 11:56:09,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:09,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:56:09,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459853347] [2019-12-07 11:56:09,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:56:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2019-12-07 11:56:09,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876829341] [2019-12-07 11:56:09,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:09,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:09,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:56:09,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:09,611 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. cyclomatic complexity: 57 Second operand 7 states. [2019-12-07 11:56:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:09,696 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2019-12-07 11:56:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:56:09,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2019-12-07 11:56:09,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:09,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 107 states and 139 transitions. [2019-12-07 11:56:09,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-12-07 11:56:09,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-12-07 11:56:09,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2019-12-07 11:56:09,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 11:56:09,698 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-12-07 11:56:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2019-12-07 11:56:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-12-07 11:56:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 11:56:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-12-07 11:56:09,699 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-12-07 11:56:09,700 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-12-07 11:56:09,700 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-12-07 11:56:09,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2019-12-07 11:56:09,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-12-07 11:56:09,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:56:09,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:56:09,700 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:09,701 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 11:56:09,701 INFO L794 eck$LassoCheckResult]: Stem: 4180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4152#L-1 havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; 4153#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4182#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4183#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4184#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4218#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4214#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4212#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4209#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4206#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4205#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4204#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4203#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4201#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4199#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4197#L79-3 assume !!(main_~i~1 < 8);call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; 4194#L79-2 main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; 4193#L79-3 assume !(main_~i~1 < 8); 4181#L79-4 call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); 4148#L51 assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); 4149#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4166#L55 assume !parse_expression_list_#t~switch4; 4160#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 4161#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4175#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4167#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4168#L55 assume parse_expression_list_#t~switch4; 4159#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 4176#L56-1 assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; 4246#L56-3 assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7; 4245#L56-6 call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); 4192#L57 assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; 4189#L57-2 parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; 4146#L59-8 parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; 4147#L59-1 assume !parse_expression_list_#t~short14; 4165#L59-6 assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short14; 4179#L59-9 parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; 4211#L60 assume !parse_expression_list_#t~short17; 4208#L60-2 assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; 4141#L60-4 assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; 4150#L62 assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; 4151#L31 parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4177#L4 assume !(0 == __VERIFIER_assert_~cond); 4190#L4-2 call write~int(0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset + (1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0)), 1); 4173#L61 parse_expression_list_~start~0 := 1 + parse_expression_list_~i~0; 4174#L54 havoc parse_expression_list_#t~switch4;havoc parse_expression_list_#t~mem3; 4202#L52-1 call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); 4200#L52-2 assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; 4198#L52-4 parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; 4195#L55 assume parse_expression_list_#t~switch4; 4156#L56-5 [2019-12-07 11:56:09,701 INFO L796 eck$LassoCheckResult]: Loop: 4156#L56-5 call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; 4162#L56-1 assume parse_expression_list_#t~short7; 4154#L56-3 assume !!parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~short7;parse_expression_list_#t~post8 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post8;havoc parse_expression_list_#t~post8; 4156#L56-5 [2019-12-07 11:56:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2019-12-07 11:56:09,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552036989] [2019-12-07 11:56:09,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 11:56:09,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552036989] [2019-12-07 11:56:09,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658856899] [2019-12-07 11:56:09,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11bf7d4d-e335-42c0-9e25-957990999d92/bin/uautomizer/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:56:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:56:09,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:56:09,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 11:56:09,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:09,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 11:56:09,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:09,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 11:56:09,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:09,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-12-07 11:56:09,862 INFO L377 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 [2019-12-07 11:56:09,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,869 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:09,870 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 11:56:09,870 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2019-12-07 11:56:09,894 INFO L377 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 [2019-12-07 11:56:09,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:56:09,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:56:09,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2019-12-07 11:56:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 11:56:09,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:56:09,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-12-07 11:56:09,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829128369] [2019-12-07 11:56:09,908 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:56:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,908 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2019-12-07 11:56:09,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329963507] [2019-12-07 11:56:09,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:09,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:56:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:56:09,942 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 10 states. [2019-12-07 11:56:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:10,095 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-12-07 11:56:10,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:56:10,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 102 transitions. [2019-12-07 11:56:10,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 11:56:10,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 11:56:10,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 11:56:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:56:10,096 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-12-07 11:56:10,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:56:10,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 11:56:10,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 11:56:10,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 11:56:10 BoogieIcfgContainer [2019-12-07 11:56:10,101 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 11:56:10,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:56:10,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:56:10,101 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:56:10,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:45" (3/4) ... [2019-12-07 11:56:10,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:56:10,104 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:56:10,105 INFO L168 Benchmark]: Toolchain (without parser) took 24722.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 940.9 MB in the beginning and 976.3 MB in the end (delta: -35.5 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:10,105 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:10,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:10,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:10,106 INFO L168 Benchmark]: Boogie Preprocessor took 19.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:10,106 INFO L168 Benchmark]: RCFGBuilder took 279.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:10,106 INFO L168 Benchmark]: BuchiAutomizer took 24157.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 93.4 MB). Peak memory consumption was 188.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:10,106 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 976.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:10,107 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 279.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24157.80 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 976.3 MB in the end (delta: 93.4 MB). Peak memory consumption was 188.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.2 GB. Free memory is still 976.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 19 terminating modules (15 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 * unknown-#length-unknown[A] + -2 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[str] + -1 * str + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * str + -1 * start + unknown-#length-unknown[A] and consists of 5 locations. One deterministic module has affine ranking function j and consists of 6 locations. 15 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.1s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 22.7s. Construction of modules took 0.5s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 232 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 167 states and ocurred in iteration 17. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 695 SDtfs, 932 SDslu, 1917 SDs, 0 SdLazy, 859 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU11 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital172 mio100 ax100 hnf100 lsp92 ukn55 mio100 lsp49 div100 bol100 ite100 ukn100 eq181 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...