./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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.24-678e011 [2019-11-20 11:03:12,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:03:12,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:03:12,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:03:12,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:03:12,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:03:12,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:03:12,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:03:12,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:03:12,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:03:12,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:03:12,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:03:12,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:03:12,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:03:12,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:03:12,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:03:12,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:03:12,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:03:12,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:03:12,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:03:12,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:03:12,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:03:12,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:03:12,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:03:12,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:03:12,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:03:12,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:03:12,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:03:12,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:03:12,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:03:12,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:03:12,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:03:12,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:03:12,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:03:12,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:03:12,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:03:12,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:03:12,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:03:12,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:03:12,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:03:12,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:03:12,969 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 11:03:12,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:03:12,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:03:12,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:03:12,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:03:12,997 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:03:12,997 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 11:03:12,997 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 11:03:12,998 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 11:03:12,998 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 11:03:12,998 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 11:03:12,998 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 11:03:12,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:03:12,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 11:03:13,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:03:13,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 11:03:13,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:03:13,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:03:13,001 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 11:03:13,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:03:13,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:03:13,012 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 11:03:13,013 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 11:03:13,013 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_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:13,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:03:13,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:03:13,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:03:13,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:03:13,181 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:03:13,182 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/../../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-20 11:03:13,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/data/625d2a179/aab52c5c7bc74157882026338b5cd1a0/FLAGfadb14b42 [2019-11-20 11:03:13,623 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:03:13,623 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-20 11:03:13,632 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/data/625d2a179/aab52c5c7bc74157882026338b5cd1a0/FLAGfadb14b42 [2019-11-20 11:03:13,962 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/data/625d2a179/aab52c5c7bc74157882026338b5cd1a0 [2019-11-20 11:03:13,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:03:13,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:03:13,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:03:13,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:03:13,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:03:13,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:03:13" (1/1) ... [2019-11-20 11:03:13,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303b91d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:13, skipping insertion in model container [2019-11-20 11:03:13,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:03:13" (1/1) ... [2019-11-20 11:03:13,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:03:14,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:03:14,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:03:14,312 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:03:14,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:03:14,367 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:03:14,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14 WrapperNode [2019-11-20 11:03:14,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:03:14,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:03:14,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:03:14,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:03:14,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:03:14,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:03:14,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:03:14,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:03:14,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... [2019-11-20 11:03:14,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:03:14,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:03:14,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:03:14,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:03:14,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:03:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:03:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:03:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-20 11:03:14,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:03:14,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:03:14,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:03:14,862 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:03:14,862 INFO L285 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-20 11:03:14,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:03:14 BoogieIcfgContainer [2019-11-20 11:03:14,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:03:14,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 11:03:14,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 11:03:14,867 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 11:03:14,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:03:14,868 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 11:03:13" (1/3) ... [2019-11-20 11:03:14,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ed4f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:03:14, skipping insertion in model container [2019-11-20 11:03:14,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:03:14,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:03:14" (2/3) ... [2019-11-20 11:03:14,870 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ed4f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 11:03:14, skipping insertion in model container [2019-11-20 11:03:14,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 11:03:14,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:03:14" (3/3) ... [2019-11-20 11:03:14,872 INFO L371 chiAutomizerObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2019-11-20 11:03:14,910 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 11:03:14,911 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 11:03:14,911 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 11:03:14,911 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:03:14,911 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:03:14,911 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 11:03:14,912 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:03:14,912 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 11:03:14,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-20 11:03:14,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-20 11:03:14,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:14,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:14,948 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 11:03:14,948 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 11:03:14,948 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 11:03:14,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2019-11-20 11:03:14,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2019-11-20 11:03:14,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:14,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:14,952 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-20 11:03:14,952 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 11:03:14,958 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-11-20 11:03:14,958 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-11-20 11:03:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-20 11:03:14,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197495718] [2019-11-20 11:03:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:15,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-20 11:03:15,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:15,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908700432] [2019-11-20 11:03:15,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,085 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-20 11:03:15,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:15,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332098491] [2019-11-20 11:03:15,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:15,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:15,315 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:03:15,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:03:15,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:03:15,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:03:15,316 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:03:15,317 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,317 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:03:15,317 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:03:15,317 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration1_Lasso [2019-11-20 11:03:15,317 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:03:15,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:03:15,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:15,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:15,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:15,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:15,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:15,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-11-20 11:03:15,600 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:03:15,603 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:15,610 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-11-20 11:03:15,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:15,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:15,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:15,637 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-11-20 11:03:15,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:15,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:15,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-11-20 11:03:15,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:15,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:15,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:15,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:15,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-11-20 11:03:15,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:15,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:15,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:15,693 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-11-20 11:03:15,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:15,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:15,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:15,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:15,703 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-11-20 11:03:15,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:15,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:15,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:15,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-11-20 11:03:15,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:15,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:15,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:15,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:15,763 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-11-20 11:03:15,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:15,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:15,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:15,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:15,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:15,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,794 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:03:15,832 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-20 11:03:15,833 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_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:15,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:15,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 11:03:15,854 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:03:15,855 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-11-20 11:03:15,866 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-20 11:03:15,874 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 11:03:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:15,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:03:15,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:15,921 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:03:15,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:15,964 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-11-20 11:03:15,965 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2019-11-20 11:03:16,093 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-11-20 11:03:16,094 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-11-20 11:03:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 11:03:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2019-11-20 11:03:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-20 11:03:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-20 11:03:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 101 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-20 11:03:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:16,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 153 transitions. [2019-11-20 11:03:16,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 32 states and 43 transitions. [2019-11-20 11:03:16,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-20 11:03:16,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:16,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2019-11-20 11:03:16,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:16,113 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-20 11:03:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2019-11-20 11:03:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-20 11:03:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 11:03:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2019-11-20 11:03:16,140 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-20 11:03:16,141 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2019-11-20 11:03:16,141 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 11:03:16,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2019-11-20 11:03:16,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:16,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:16,143 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:16,143 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:16,144 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-11-20 11:03:16,144 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-11-20 11:03:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28696938, now seen corresponding path program 1 times [2019-11-20 11:03:16,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172912355] [2019-11-20 11:03:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172912355] [2019-11-20 11:03:16,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:16,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:03:16,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333931831] [2019-11-20 11:03:16,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 1 times [2019-11-20 11:03:16,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668595] [2019-11-20 11:03:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:16,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:16,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:03:16,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:03:16,285 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-20 11:03:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:16,302 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-11-20 11:03:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:03:16,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-11-20 11:03:16,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-11-20 11:03:16,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:16,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:16,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-11-20 11:03:16,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:16,307 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-20 11:03:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-11-20 11:03:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-20 11:03:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 11:03:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-20 11:03:16,310 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-20 11:03:16,310 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-20 11:03:16,310 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 11:03:16,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2019-11-20 11:03:16,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:16,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:16,312 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:03:16,313 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:16,313 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-11-20 11:03:16,313 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-11-20 11:03:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1809669544, now seen corresponding path program 1 times [2019-11-20 11:03:16,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598817822] [2019-11-20 11:03:16,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598817822] [2019-11-20 11:03:16,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130871217] [2019-11-20 11:03:16,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:16,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:03:16,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:16,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-20 11:03:16,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31897052] [2019-11-20 11:03:16,453 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:16,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 2 times [2019-11-20 11:03:16,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044154680] [2019-11-20 11:03:16,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:16,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:16,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:03:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:03:16,544 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-20 11:03:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:16,572 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-11-20 11:03:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:03:16,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2019-11-20 11:03:16,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 45 transitions. [2019-11-20 11:03:16,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:16,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:16,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-11-20 11:03:16,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:16,577 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-11-20 11:03:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-11-20 11:03:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-20 11:03:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 11:03:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-11-20 11:03:16,587 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-20 11:03:16,587 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-20 11:03:16,587 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 11:03:16,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-11-20 11:03:16,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:16,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:16,592 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-20 11:03:16,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:16,592 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-11-20 11:03:16,593 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-11-20 11:03:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -367607194, now seen corresponding path program 2 times [2019-11-20 11:03:16,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783129891] [2019-11-20 11:03:16,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783129891] [2019-11-20 11:03:16,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731857943] [2019-11-20 11:03:16,652 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:16,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:03:16,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:03:16,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:03:16,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-20 11:03:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51389682] [2019-11-20 11:03:16,728 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,729 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 3 times [2019-11-20 11:03:16,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046784176] [2019-11-20 11:03:16,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:16,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:16,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:03:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:03:16,822 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-20 11:03:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:16,856 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-20 11:03:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:03:16,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-20 11:03:16,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 47 transitions. [2019-11-20 11:03:16,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:16,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:16,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-11-20 11:03:16,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:16,863 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-11-20 11:03:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-11-20 11:03:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-20 11:03:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 11:03:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-11-20 11:03:16,869 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-20 11:03:16,869 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-20 11:03:16,869 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 11:03:16,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2019-11-20 11:03:16,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:16,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:16,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:16,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2019-11-20 11:03:16,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:16,872 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-11-20 11:03:16,873 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-11-20 11:03:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1081479260, now seen corresponding path program 3 times [2019-11-20 11:03:16,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:16,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725404236] [2019-11-20 11:03:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:16,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725404236] [2019-11-20 11:03:16,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774412561] [2019-11-20 11:03:16,972 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:17,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 11:03:17,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:03:17,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:03:17,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:17,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-20 11:03:17,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789236727] [2019-11-20 11:03:17,078 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 4 times [2019-11-20 11:03:17,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659590688] [2019-11-20 11:03:17,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:17,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:03:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:03:17,181 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-20 11:03:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:17,210 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-11-20 11:03:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:03:17,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2019-11-20 11:03:17,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2019-11-20 11:03:17,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:17,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:17,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2019-11-20 11:03:17,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:17,216 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-11-20 11:03:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2019-11-20 11:03:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-11-20 11:03:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 11:03:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2019-11-20 11:03:17,223 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-20 11:03:17,223 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-20 11:03:17,223 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 11:03:17,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2019-11-20 11:03:17,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:17,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:17,224 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2019-11-20 11:03:17,225 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:17,225 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-11-20 11:03:17,225 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-11-20 11:03:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash 82232674, now seen corresponding path program 4 times [2019-11-20 11:03:17,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729307834] [2019-11-20 11:03:17,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729307834] [2019-11-20 11:03:17,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924425188] [2019-11-20 11:03:17,311 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:17,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 11:03:17,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:03:17,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:03:17,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:17,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 11:03:17,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727418241] [2019-11-20 11:03:17,386 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 5 times [2019-11-20 11:03:17,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321985415] [2019-11-20 11:03:17,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,402 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:17,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:03:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:03:17,464 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-20 11:03:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:17,492 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-11-20 11:03:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:03:17,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-20 11:03:17,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-11-20 11:03:17,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:17,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:17,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-11-20 11:03:17,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:17,500 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-11-20 11:03:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-11-20 11:03:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-20 11:03:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 11:03:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-11-20 11:03:17,508 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-20 11:03:17,508 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-11-20 11:03:17,508 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 11:03:17,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-11-20 11:03:17,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:17,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:17,510 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1] [2019-11-20 11:03:17,510 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:17,511 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-11-20 11:03:17,511 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-11-20 11:03:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1717904288, now seen corresponding path program 5 times [2019-11-20 11:03:17,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249331902] [2019-11-20 11:03:17,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249331902] [2019-11-20 11:03:17,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944567922] [2019-11-20 11:03:17,574 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:17,630 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 11:03:17,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:03:17,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:03:17,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:17,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-20 11:03:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847356884] [2019-11-20 11:03:17,643 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 6 times [2019-11-20 11:03:17,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70116794] [2019-11-20 11:03:17,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:17,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:17,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 11:03:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:03:17,720 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 12 Second operand 9 states. [2019-11-20 11:03:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:17,756 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-11-20 11:03:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:03:17,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2019-11-20 11:03:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 53 transitions. [2019-11-20 11:03:17,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:17,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-20 11:03:17,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:17,758 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-20 11:03:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-20 11:03:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-11-20 11:03:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 11:03:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-20 11:03:17,761 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 11:03:17,761 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 11:03:17,761 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 11:03:17,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 52 transitions. [2019-11-20 11:03:17,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:17,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:17,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:17,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1] [2019-11-20 11:03:17,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:17,763 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-11-20 11:03:17,764 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-11-20 11:03:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1640295006, now seen corresponding path program 6 times [2019-11-20 11:03:17,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043330670] [2019-11-20 11:03:17,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043330670] [2019-11-20 11:03:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774126913] [2019-11-20 11:03:17,825 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:17,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-20 11:03:17,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:03:17,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 11:03:17,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:17,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:17,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-20 11:03:17,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447792400] [2019-11-20 11:03:17,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 7 times [2019-11-20 11:03:17,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:17,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420013871] [2019-11-20 11:03:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:17,924 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:17,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:03:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:03:17,977 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. cyclomatic complexity: 12 Second operand 10 states. [2019-11-20 11:03:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:18,004 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-20 11:03:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:03:18,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-11-20 11:03:18,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:18,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-11-20 11:03:18,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:18,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:18,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-11-20 11:03:18,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:18,007 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-11-20 11:03:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-11-20 11:03:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-20 11:03:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 11:03:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-11-20 11:03:18,010 INFO L711 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-20 11:03:18,010 INFO L591 BuchiCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-11-20 11:03:18,010 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 11:03:18,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2019-11-20 11:03:18,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:18,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:18,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:18,011 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1] [2019-11-20 11:03:18,011 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:18,012 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-11-20 11:03:18,012 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-11-20 11:03:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 72219036, now seen corresponding path program 7 times [2019-11-20 11:03:18,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:18,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378067608] [2019-11-20 11:03:18,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:18,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378067608] [2019-11-20 11:03:18,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390963803] [2019-11-20 11:03:18,117 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:18,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 11:03:18,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:18,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:18,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-20 11:03:18,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781705136] [2019-11-20 11:03:18,180 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 8 times [2019-11-20 11:03:18,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:18,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200739392] [2019-11-20 11:03:18,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:18,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:18,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 11:03:18,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-20 11:03:18,259 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. cyclomatic complexity: 12 Second operand 11 states. [2019-11-20 11:03:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:18,298 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-11-20 11:03:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:03:18,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2019-11-20 11:03:18,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:18,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2019-11-20 11:03:18,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:18,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:18,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2019-11-20 11:03:18,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:18,301 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-20 11:03:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2019-11-20 11:03:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-20 11:03:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 11:03:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-11-20 11:03:18,304 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-20 11:03:18,304 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-11-20 11:03:18,304 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 11:03:18,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 56 transitions. [2019-11-20 11:03:18,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-11-20 11:03:18,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:18,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:18,306 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1] [2019-11-20 11:03:18,306 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:18,306 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-11-20 11:03:18,306 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-11-20 11:03:18,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 684732762, now seen corresponding path program 8 times [2019-11-20 11:03:18,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:18,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447674491] [2019-11-20 11:03:18,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 55413311, now seen corresponding path program 9 times [2019-11-20 11:03:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:18,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059895815] [2019-11-20 11:03:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 299059334, now seen corresponding path program 1 times [2019-11-20 11:03:18,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:18,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918834206] [2019-11-20 11:03:18,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:18,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:22,912 WARN L191 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 194 DAG size of output: 146 [2019-11-20 11:03:23,139 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-20 11:03:23,142 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:03:23,142 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:03:23,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:03:23,142 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:03:23,142 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:03:23,142 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,142 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:03:23,142 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:03:23,142 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration10_Lasso [2019-11-20 11:03:23,143 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:03:23,143 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:03:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,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-11-20 11:03:23,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-11-20 11:03:23,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-11-20 11:03:23,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-11-20 11:03:23,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-11-20 11:03:23,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-11-20 11:03:23,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,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-11-20 11:03:23,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:23,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-11-20 11:03:23,594 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:03:23,594 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,597 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-11-20 11:03:23,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,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_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,607 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-11-20 11:03:23,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,615 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-11-20 11:03:23,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,634 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-11-20 11:03:23,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,662 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-11-20 11:03:23,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:23,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_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:23,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:23,703 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-11-20 11:03:23,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:23,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,727 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-11-20 11:03:23,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,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-11-20 11:03:23,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,754 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-11-20 11:03:23,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:23,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:23,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,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-11-20 11:03:23,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:23,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 11:03:23,791 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-11-20 11:03:23,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,808 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-11-20 11:03:23,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,826 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-11-20 11:03:23,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,844 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-11-20 11:03:23,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,866 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-11-20 11:03:23,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:23,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:23,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:23,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:23,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:23,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:03:23,924 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 11:03:23,924 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_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:23,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:23,931 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 11:03:23,931 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:03:23,931 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-11-20 11:03:23,948 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-20 11:03:23,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 11:03:23,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:23,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:03:23,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:23,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:03:23,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:24,012 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-11-20 11:03:24,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 56 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-20 11:03:24,054 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-11-20 11:03:24,055 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-11-20 11:03:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 11:03:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2019-11-20 11:03:24,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 5 letters. [2019-11-20 11:03:24,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:24,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 26 letters. Loop has 5 letters. [2019-11-20 11:03:24,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:24,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 21 letters. Loop has 10 letters. [2019-11-20 11:03:24,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:24,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2019-11-20 11:03:24,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:24,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 75 transitions. [2019-11-20 11:03:24,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 11:03:24,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-20 11:03:24,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 75 transitions. [2019-11-20 11:03:24,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:24,061 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-11-20 11:03:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 75 transitions. [2019-11-20 11:03:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-20 11:03:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 11:03:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-11-20 11:03:24,064 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-20 11:03:24,064 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-20 11:03:24,064 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-20 11:03:24,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2019-11-20 11:03:24,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:24,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:24,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:24,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:03:24,065 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:24,066 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-11-20 11:03:24,067 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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-11-20 11:03:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash 898188797, now seen corresponding path program 1 times [2019-11-20 11:03:24,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486564952] [2019-11-20 11:03:24,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,135 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 1 times [2019-11-20 11:03:24,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937349421] [2019-11-20 11:03:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,141 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 296230220, now seen corresponding path program 1 times [2019-11-20 11:03:24,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286646129] [2019-11-20 11:03:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:24,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286646129] [2019-11-20 11:03:24,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:24,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 11:03:24,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267967758] [2019-11-20 11:03:24,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:03:24,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:03:24,397 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. cyclomatic complexity: 20 Second operand 7 states. [2019-11-20 11:03:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:24,548 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-11-20 11:03:24,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:03:24,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 118 transitions. [2019-11-20 11:03:24,550 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-20 11:03:24,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 118 transitions. [2019-11-20 11:03:24,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 11:03:24,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 11:03:24,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 118 transitions. [2019-11-20 11:03:24,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:24,552 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-11-20 11:03:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 118 transitions. [2019-11-20 11:03:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2019-11-20 11:03:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 11:03:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-11-20 11:03:24,555 INFO L711 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-20 11:03:24,555 INFO L591 BuchiCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-20 11:03:24,555 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-20 11:03:24,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 83 transitions. [2019-11-20 11:03:24,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:24,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:24,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:24,557 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:03:24,557 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:24,557 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-11-20 11:03:24,557 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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-11-20 11:03:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash -366788055, now seen corresponding path program 1 times [2019-11-20 11:03:24,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312072348] [2019-11-20 11:03:24,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 2 times [2019-11-20 11:03:24,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371372180] [2019-11-20 11:03:24,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash -586112608, now seen corresponding path program 1 times [2019-11-20 11:03:24,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:24,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820115287] [2019-11-20 11:03:24,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:24,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:31,513 WARN L191 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 236 DAG size of output: 170 [2019-11-20 11:03:31,820 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-20 11:03:31,821 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:03:31,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:03:31,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:03:31,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:03:31,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:03:31,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:31,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:03:31,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:03:31,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration12_Lasso [2019-11-20 11:03:31,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:03:31,822 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:03:31,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:31,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:32,381 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:03:32,381 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,398 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-11-20 11:03:32,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,409 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-11-20 11:03:32,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,418 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-11-20 11:03:32,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,421 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,431 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-11-20 11:03:32,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,451 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-11-20 11:03:32,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,461 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-11-20 11:03:32,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,468 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-11-20 11:03:32,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,476 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-11-20 11:03:32,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,486 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-11-20 11:03:32,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:32,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,489 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:32,489 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:32,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,499 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-11-20 11:03:32,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,508 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-11-20 11:03:32,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,535 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-11-20 11:03:32,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 11:03:32,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,570 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-11-20 11:03:32,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,592 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-11-20 11:03:32,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,595 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,595 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,609 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-11-20 11:03:32,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:32,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:32,628 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-11-20 11:03:32,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:32,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:32,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:32,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:32,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:32,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:32,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:03:32,681 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2019-11-20 11:03:32,681 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_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:32,684 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 11:03:32,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 11:03:32,686 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:03:32,686 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_parse_expression_list_~str.offset, v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3, ULTIMATE.start_parse_expression_list_~start~0) = -1*ULTIMATE.start_parse_expression_list_~str.offset + 1*v_rep(select #length ULTIMATE.start_main_~#A~0.base)_3 - 1*ULTIMATE.start_parse_expression_list_~start~0 Supporting invariants [] [2019-11-20 11:03:32,702 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-20 11:03:32,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 11:03:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:32,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:03:32,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:32,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:03:32,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:32,770 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-11-20 11:03:32,770 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 83 transitions. cyclomatic complexity: 22 Second operand 4 states. [2019-11-20 11:03:32,867 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-11-20 11:03:32,869 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-11-20 11:03:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 11:03:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2019-11-20 11:03:32,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-20 11:03:32,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:32,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 31 letters. Loop has 3 letters. [2019-11-20 11:03:32,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:32,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 28 letters. Loop has 6 letters. [2019-11-20 11:03:32,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:32,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 237 transitions. [2019-11-20 11:03:32,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2019-11-20 11:03:32,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 136 states and 181 transitions. [2019-11-20 11:03:32,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-20 11:03:32,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-20 11:03:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 181 transitions. [2019-11-20 11:03:32,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:32,875 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 181 transitions. [2019-11-20 11:03:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 181 transitions. [2019-11-20 11:03:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 91. [2019-11-20 11:03:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-20 11:03:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2019-11-20 11:03:32,880 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-20 11:03:32,881 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2019-11-20 11:03:32,881 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-20 11:03:32,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2019-11-20 11:03:32,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:32,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:32,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:32,882 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:03:32,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:32,883 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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-11-20 11:03:32,883 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1161474036, now seen corresponding path program 1 times [2019-11-20 11:03:32,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:32,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760696772] [2019-11-20 11:03:32,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:33,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760696772] [2019-11-20 11:03:33,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:33,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:03:33,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233240453] [2019-11-20 11:03:33,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash 89761, now seen corresponding path program 1 times [2019-11-20 11:03:33,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170529890] [2019-11-20 11:03:33,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:33,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170529890] [2019-11-20 11:03:33,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:33,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:03:33,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596774481] [2019-11-20 11:03:33,136 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 11:03:33,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:03:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:03:33,136 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. cyclomatic complexity: 38 Second operand 3 states. [2019-11-20 11:03:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:33,146 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-11-20 11:03:33,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:03:33,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 123 transitions. [2019-11-20 11:03:33,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:33,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 122 transitions. [2019-11-20 11:03:33,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 11:03:33,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 11:03:33,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 122 transitions. [2019-11-20 11:03:33,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:33,149 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-20 11:03:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 122 transitions. [2019-11-20 11:03:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-20 11:03:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 11:03:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2019-11-20 11:03:33,153 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-20 11:03:33,153 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 122 transitions. [2019-11-20 11:03:33,153 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-20 11:03:33,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 122 transitions. [2019-11-20 11:03:33,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:33,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:33,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:33,155 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:03:33,155 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:33,155 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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-11-20 11:03:33,155 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1161473974, now seen corresponding path program 1 times [2019-11-20 11:03:33,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219800615] [2019-11-20 11:03:33,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 1 times [2019-11-20 11:03:33,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288437929] [2019-11-20 11:03:33,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1035891741, now seen corresponding path program 1 times [2019-11-20 11:03:33,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010342836] [2019-11-20 11:03:33,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:33,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010342836] [2019-11-20 11:03:33,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:33,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 11:03:33,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736920976] [2019-11-20 11:03:33,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:33,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:03:33,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:03:33,290 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. cyclomatic complexity: 37 Second operand 6 states. [2019-11-20 11:03:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:33,362 INFO L93 Difference]: Finished difference Result 143 states and 182 transitions. [2019-11-20 11:03:33,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:03:33,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 182 transitions. [2019-11-20 11:03:33,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-20 11:03:33,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 131 states and 169 transitions. [2019-11-20 11:03:33,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-20 11:03:33,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-20 11:03:33,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 169 transitions. [2019-11-20 11:03:33,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:33,369 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 169 transitions. [2019-11-20 11:03:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 169 transitions. [2019-11-20 11:03:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2019-11-20 11:03:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 11:03:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-11-20 11:03:33,376 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-20 11:03:33,376 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-11-20 11:03:33,376 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-20 11:03:33,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 124 transitions. [2019-11-20 11:03:33,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:33,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:33,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:33,378 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-11-20 11:03:33,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:33,378 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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-11-20 11:03:33,378 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1836811402, now seen corresponding path program 1 times [2019-11-20 11:03:33,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443200702] [2019-11-20 11:03:33,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 2 times [2019-11-20 11:03:33,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136860646] [2019-11-20 11:03:33,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,442 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash 282551409, now seen corresponding path program 1 times [2019-11-20 11:03:33,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283504956] [2019-11-20 11:03:33,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:33,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283504956] [2019-11-20 11:03:33,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43255039] [2019-11-20 11:03:33,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:33,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 11:03:33,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:03:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:33,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-20 11:03:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032156725] [2019-11-20 11:03:33,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:03:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:03:33,676 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. cyclomatic complexity: 35 Second operand 7 states. [2019-11-20 11:03:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:33,806 INFO L93 Difference]: Finished difference Result 186 states and 244 transitions. [2019-11-20 11:03:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:03:33,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 244 transitions. [2019-11-20 11:03:33,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-20 11:03:33,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 171 states and 222 transitions. [2019-11-20 11:03:33,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-20 11:03:33,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-20 11:03:33,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 222 transitions. [2019-11-20 11:03:33,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:33,810 INFO L688 BuchiCegarLoop]: Abstraction has 171 states and 222 transitions. [2019-11-20 11:03:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 222 transitions. [2019-11-20 11:03:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-11-20 11:03:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-20 11:03:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2019-11-20 11:03:33,820 INFO L711 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-20 11:03:33,820 INFO L591 BuchiCegarLoop]: Abstraction has 136 states and 177 transitions. [2019-11-20 11:03:33,820 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-20 11:03:33,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 177 transitions. [2019-11-20 11:03:33,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-20 11:03:33,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:33,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:33,824 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-11-20 11:03:33,829 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-20 11:03:33,829 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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-11-20 11:03:33,831 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:33,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1704815500, now seen corresponding path program 1 times [2019-11-20 11:03:33,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180948639] [2019-11-20 11:03:33,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,865 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash 85982918, now seen corresponding path program 3 times [2019-11-20 11:03:33,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008696909] [2019-11-20 11:03:33,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 492769819, now seen corresponding path program 1 times [2019-11-20 11:03:33,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:33,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130577688] [2019-11-20 11:03:33,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:33,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 11:03:39,933 WARN L191 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 291 DAG size of output: 200 [2019-11-20 11:03:40,220 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-20 11:03:40,222 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 11:03:40,223 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 11:03:40,223 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 11:03:40,223 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 11:03:40,223 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 11:03:40,223 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:40,223 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 11:03:40,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 11:03:40,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: veris.c_OpenSER_cases1_stripFullBoth_arr.i_Iteration16_Lasso [2019-11-20 11:03:40,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 11:03:40,223 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 11:03:40,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 11:03:40,871 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 11:03:40,871 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,877 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-11-20 11:03:40,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,889 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-11-20 11:03:40,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,897 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-11-20 11:03:40,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,904 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-11-20 11:03:40,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:40,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:40,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:40,922 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-11-20 11:03:40,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:40,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_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:40,934 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-11-20 11:03:40,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:40,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:40,944 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-11-20 11:03:40,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:40,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,954 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-11-20 11:03:40,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,961 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-11-20 11:03:40,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,968 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-11-20 11:03:40,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:40,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:40,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,977 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-11-20 11:03:40,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,984 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-11-20 11:03:40,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,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_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,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-11-20 11:03:40,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:40,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:40,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:40,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:40,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:40,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:40,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:40,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:40,998 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-11-20 11:03:40,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:41,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,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-11-20 11:03:41,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:41,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:41,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:41,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,016 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-11-20 11:03:41,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 11:03:41,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 11:03:41,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 11:03:41,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,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-11-20 11:03:41,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:41,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,031 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-11-20 11:03:41,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:41,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,041 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-11-20 11:03:41,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:41,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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) [2019-11-20 11:03:41,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 11:03:41,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,052 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-20 11:03:41,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,054 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-20 11:03:41,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,079 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-11-20 11:03:41,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 11:03:41,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 11:03:41,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 11:03:41,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 11:03:41,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 11:03:41,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 11:03:41,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 11:03:41,109 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-11-20 11:03:41,110 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_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:41,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 11:03:41,116 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 11:03:41,116 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 11:03:41,116 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-11-20 11:03:41,134 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-20 11:03:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:41,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:03:41,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:41,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 11:03:41,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:03:41,228 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-11-20 11:03:41,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 177 transitions. cyclomatic complexity: 51 Second operand 4 states. [2019-11-20 11:03:41,338 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-11-20 11:03:41,340 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-11-20 11:03:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 11:03:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2019-11-20 11:03:41,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 5 letters. [2019-11-20 11:03:41,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:41,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 44 letters. Loop has 5 letters. [2019-11-20 11:03:41,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:41,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 82 transitions. Stem has 39 letters. Loop has 10 letters. [2019-11-20 11:03:41,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 11:03:41,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 296 states and 391 transitions. [2019-11-20 11:03:41,344 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 17 [2019-11-20 11:03:41,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 296 states to 196 states and 256 transitions. [2019-11-20 11:03:41,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-20 11:03:41,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-20 11:03:41,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 256 transitions. [2019-11-20 11:03:41,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:41,352 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 256 transitions. [2019-11-20 11:03:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 256 transitions. [2019-11-20 11:03:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 142. [2019-11-20 11:03:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-20 11:03:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2019-11-20 11:03:41,357 INFO L711 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-20 11:03:41,358 INFO L591 BuchiCegarLoop]: Abstraction has 142 states and 184 transitions. [2019-11-20 11:03:41,358 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-20 11:03:41,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 184 transitions. [2019-11-20 11:03:41,359 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-20 11:03:41,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:41,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:41,362 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-11-20 11:03:41,362 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:41,363 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:41,363 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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-11-20 11:03:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash -207736402, now seen corresponding path program 1 times [2019-11-20 11:03:41,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:41,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974502222] [2019-11-20 11:03:41,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:41,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974502222] [2019-11-20 11:03:41,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:41,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:03:41,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349483860] [2019-11-20 11:03:41,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 3 times [2019-11-20 11:03:41,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:41,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524025017] [2019-11-20 11:03:41,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:41,499 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:41,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:41,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:03:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:03:41,555 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. cyclomatic complexity: 52 Second operand 8 states. [2019-11-20 11:03:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:41,857 INFO L93 Difference]: Finished difference Result 232 states and 304 transitions. [2019-11-20 11:03:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:03:41,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 304 transitions. [2019-11-20 11:03:41,860 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 24 [2019-11-20 11:03:41,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 196 states and 252 transitions. [2019-11-20 11:03:41,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-11-20 11:03:41,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-11-20 11:03:41,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 252 transitions. [2019-11-20 11:03:41,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:41,862 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 252 transitions. [2019-11-20 11:03:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 252 transitions. [2019-11-20 11:03:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 167. [2019-11-20 11:03:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-20 11:03:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2019-11-20 11:03:41,870 INFO L711 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-11-20 11:03:41,871 INFO L591 BuchiCegarLoop]: Abstraction has 167 states and 214 transitions. [2019-11-20 11:03:41,871 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-20 11:03:41,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 214 transitions. [2019-11-20 11:03:41,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-11-20 11:03:41,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:41,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:41,875 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-11-20 11:03:41,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:41,875 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:41,875 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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-11-20 11:03:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1896680144, now seen corresponding path program 1 times [2019-11-20 11:03:41,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:41,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504282425] [2019-11-20 11:03:41,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-20 11:03:41,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504282425] [2019-11-20 11:03:41,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:03:41,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 11:03:41,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291784955] [2019-11-20 11:03:41,964 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 4 times [2019-11-20 11:03:41,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:41,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377376120] [2019-11-20 11:03:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:41,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:42,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:42,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:03:42,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:03:42,022 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. cyclomatic complexity: 57 Second operand 7 states. [2019-11-20 11:03:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:42,187 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2019-11-20 11:03:42,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:03:42,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 154 transitions. [2019-11-20 11:03:42,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:42,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 107 states and 139 transitions. [2019-11-20 11:03:42,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-20 11:03:42,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-20 11:03:42,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 139 transitions. [2019-11-20 11:03:42,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 11:03:42,190 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-20 11:03:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 139 transitions. [2019-11-20 11:03:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 11:03:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 11:03:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-11-20 11:03:42,192 INFO L711 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-20 11:03:42,192 INFO L591 BuchiCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-20 11:03:42,193 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-20 11:03:42,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 139 transitions. [2019-11-20 11:03:42,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-20 11:03:42,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 11:03:42,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 11:03:42,198 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-11-20 11:03:42,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 11:03:42,199 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6; 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~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~mem12;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-11-20 11:03:42,200 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~mem5;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem6;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-11-20 11:03:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1759377532, now seen corresponding path program 1 times [2019-11-20 11:03:42,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:42,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66248643] [2019-11-20 11:03:42,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 11:03:42,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66248643] [2019-11-20 11:03:42,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566421263] [2019-11-20 11:03:42,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6b9a806f-d115-4cbd-8df5-369326ff1689/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-11-20 11:03:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:03:42,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 11:03:42,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:03:42,410 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-11-20 11:03:42,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:03:42,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 11:03:42,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:03:42,427 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-11-20 11:03:42,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:03:42,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 11:03:42,470 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-11-20 11:03:42,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:03:42,479 INFO L496 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-11-20 11:03:42,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:27 [2019-11-20 11:03:42,522 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-11-20 11:03:42,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:03:42,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:03:42,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:36, output treesize:3 [2019-11-20 11:03:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 11:03:42,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:03:42,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 11:03:42,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452829950] [2019-11-20 11:03:42,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 11:03:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:03:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash 62664, now seen corresponding path program 5 times [2019-11-20 11:03:42,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:03:42,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126058280] [2019-11-20 11:03:42,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:03:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:03:42,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:03:42,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:03:42,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 11:03:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 11:03:42,593 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. cyclomatic complexity: 40 Second operand 10 states. [2019-11-20 11:03:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:03:42,796 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2019-11-20 11:03:42,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:03:42,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 102 transitions. [2019-11-20 11:03:42,797 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:03:42,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-20 11:03:42,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-20 11:03:42,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 11:03:42,798 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-20 11:03:42,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-20 11:03:42,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-20 11:03:42,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-20 11:03:42,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 11:03:42 BoogieIcfgContainer [2019-11-20 11:03:42,805 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-20 11:03:42,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:03:42,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:03:42,805 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:03:42,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:03:14" (3/4) ... [2019-11-20 11:03:42,809 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:03:42,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:03:42,810 INFO L168 Benchmark]: Toolchain (without parser) took 28845.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 944.8 MB in the beginning and 953.8 MB in the end (delta: -9.0 MB). Peak memory consumption was 221.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:03:42,811 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:03:42,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:03:42,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:03:42,812 INFO L168 Benchmark]: Boogie Preprocessor took 28.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:03:42,812 INFO L168 Benchmark]: RCFGBuilder took 427.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:03:42,813 INFO L168 Benchmark]: BuchiAutomizer took 27940.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 146.6 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:03:42,813 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.3 GB. Free memory is still 953.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:03:42,815 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 427.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27940.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.2 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 146.6 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.3 GB. Free memory is still 953.8 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 + unknown-#length-unknown[A] + -1 * start 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 27.9s and 20 iterations. TraceHistogramMax:8. Analysis of lassos took 25.5s. Construction of modules took 0.9s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 9. Automata minimization 0.1s 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.9s 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: 11ms 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...