./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d225bacde2ff4b43f974edb4824451ea41bcc5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6d225bacde2ff4b43f974edb4824451ea41bcc5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:44:24,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:44:24,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:44:24,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:44:24,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:44:24,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:44:24,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:44:24,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:44:24,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:44:24,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:44:24,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:44:24,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:44:24,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:44:24,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:44:24,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:44:24,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:44:24,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:44:24,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:44:24,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:44:24,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:44:24,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:44:24,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:44:24,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:44:24,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:44:24,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:44:24,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:44:24,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:44:24,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:44:24,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:44:24,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:44:24,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:44:24,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:44:24,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:44:24,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:44:24,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:44:24,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:44:24,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:44:24,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:44:24,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:44:24,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:44:24,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:44:24,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 06:44:24,832 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:44:24,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:44:24,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:44:24,844 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:44:24,844 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:44:24,844 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:44:24,845 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:44:24,845 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:44:24,845 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:44:24,845 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:44:24,852 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:44:24,853 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:44:24,853 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:44:24,853 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:44:24,854 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:44:24,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:44:24,855 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:44:24,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:44:24,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:44:24,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:44:24,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 06:44:24,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:44:24,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 06:44:24,856 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:44:24,856 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:44:24,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 06:44:24,857 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:44:24,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 06:44:24,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:44:24,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:44:24,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:24,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:44:24,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:44:24,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 06:44:24,861 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:44:24,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:44:24,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 06:44:24,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:44:24,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:44:24,862 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2021-10-13 06:44:25,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:44:25,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:44:25,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:44:25,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:44:25,150 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:44:25,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 06:44:25,215 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/5ca35106c/5ee6ddf2f81e412188a6bfad0fc1f48a/FLAG6f8e97ce0 [2021-10-13 06:44:25,685 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:44:25,686 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 06:44:25,695 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/5ca35106c/5ee6ddf2f81e412188a6bfad0fc1f48a/FLAG6f8e97ce0 [2021-10-13 06:44:26,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/5ca35106c/5ee6ddf2f81e412188a6bfad0fc1f48a [2021-10-13 06:44:26,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:44:26,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:44:26,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:26,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:44:26,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:44:26,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a4ded0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26, skipping insertion in model container [2021-10-13 06:44:26,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:44:26,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:44:26,294 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 06:44:26,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:26,350 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:44:26,362 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 06:44:26,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:26,405 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:44:26,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26 WrapperNode [2021-10-13 06:44:26,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:26,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:26,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:44:26,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:44:26,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:26,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:44:26,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:44:26,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:44:26,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:44:26,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:44:26,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:44:26,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:44:26,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (1/1) ... [2021-10-13 06:44:26,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:26,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:26,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:44:26,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:44:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:44:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:44:26,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:44:26,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:44:27,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:44:27,596 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-10-13 06:44:27,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:27 BoogieIcfgContainer [2021-10-13 06:44:27,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:44:27,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:44:27,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:44:27,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:44:27,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:44:26" (1/3) ... [2021-10-13 06:44:27,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1559df74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:27, skipping insertion in model container [2021-10-13 06:44:27,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:26" (2/3) ... [2021-10-13 06:44:27,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1559df74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:27, skipping insertion in model container [2021-10-13 06:44:27,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:27" (3/3) ... [2021-10-13 06:44:27,618 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-10-13 06:44:27,624 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:44:27,624 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 06:44:27,686 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:44:27,695 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 06:44:27,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 06:44:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 06:44:27,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:27,719 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:27,720 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash -724632320, now seen corresponding path program 1 times [2021-10-13 06:44:27,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:27,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384596264] [2021-10-13 06:44:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:27,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:27,910 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:27,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384596264] [2021-10-13 06:44:27,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384596264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:27,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:27,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:27,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697065460] [2021-10-13 06:44:27,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:27,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:27,935 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:27,980 INFO L93 Difference]: Finished difference Result 118 states and 185 transitions. [2021-10-13 06:44:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:27,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 06:44:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:27,992 INFO L225 Difference]: With dead ends: 118 [2021-10-13 06:44:27,992 INFO L226 Difference]: Without dead ends: 72 [2021-10-13 06:44:27,995 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-13 06:44:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2021-10-13 06:44:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.492063492063492) internal successors, (94), 64 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2021-10-13 06:44:28,034 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 18 [2021-10-13 06:44:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,035 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2021-10-13 06:44:28,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2021-10-13 06:44:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 06:44:28,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,036 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:44:28,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1390363201, now seen corresponding path program 1 times [2021-10-13 06:44:28,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049448630] [2021-10-13 06:44:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:28,097 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049448630] [2021-10-13 06:44:28,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049448630] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:28,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851163758] [2021-10-13 06:44:28,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:28,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,102 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,129 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2021-10-13 06:44:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 06:44:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,132 INFO L225 Difference]: With dead ends: 177 [2021-10-13 06:44:28,132 INFO L226 Difference]: Without dead ends: 117 [2021-10-13 06:44:28,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-13 06:44:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2021-10-13 06:44:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2021-10-13 06:44:28,149 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 18 [2021-10-13 06:44:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,149 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2021-10-13 06:44:28,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2021-10-13 06:44:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:44:28,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 06:44:28,152 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash -74750184, now seen corresponding path program 1 times [2021-10-13 06:44:28,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609647280] [2021-10-13 06:44:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:28,221 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609647280] [2021-10-13 06:44:28,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609647280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:28,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366958812] [2021-10-13 06:44:28,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:28,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,226 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,288 INFO L93 Difference]: Finished difference Result 212 states and 307 transitions. [2021-10-13 06:44:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:44:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,291 INFO L225 Difference]: With dead ends: 212 [2021-10-13 06:44:28,294 INFO L226 Difference]: Without dead ends: 133 [2021-10-13 06:44:28,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-13 06:44:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2021-10-13 06:44:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.4375) internal successors, (184), 129 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 184 transitions. [2021-10-13 06:44:28,318 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 184 transitions. Word has length 19 [2021-10-13 06:44:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,318 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 184 transitions. [2021-10-13 06:44:28,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 184 transitions. [2021-10-13 06:44:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:28,320 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,321 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:28,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 06:44:28,321 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -976140625, now seen corresponding path program 1 times [2021-10-13 06:44:28,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953614661] [2021-10-13 06:44:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:28,401 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953614661] [2021-10-13 06:44:28,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953614661] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 06:44:28,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176200809] [2021-10-13 06:44:28,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:28,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,408 INFO L87 Difference]: Start difference. First operand 130 states and 184 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,449 INFO L93 Difference]: Finished difference Result 263 states and 383 transitions. [2021-10-13 06:44:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 06:44:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,453 INFO L225 Difference]: With dead ends: 263 [2021-10-13 06:44:28,453 INFO L226 Difference]: Without dead ends: 181 [2021-10-13 06:44:28,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-10-13 06:44:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2021-10-13 06:44:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.457516339869281) internal successors, (223), 154 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2021-10-13 06:44:28,484 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 26 [2021-10-13 06:44:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,484 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2021-10-13 06:44:28,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2021-10-13 06:44:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:28,486 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,486 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 06:44:28,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 06:44:28,487 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:28,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1557958669, now seen corresponding path program 1 times [2021-10-13 06:44:28,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453432577] [2021-10-13 06:44:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:28,551 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453432577] [2021-10-13 06:44:28,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453432577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:28,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:28,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:28,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937042433] [2021-10-13 06:44:28,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:28,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:28,554 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:28,579 INFO L93 Difference]: Finished difference Result 193 states and 279 transitions. [2021-10-13 06:44:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:28,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 06:44:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:28,585 INFO L225 Difference]: With dead ends: 193 [2021-10-13 06:44:28,586 INFO L226 Difference]: Without dead ends: 191 [2021-10-13 06:44:28,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-10-13 06:44:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 153. [2021-10-13 06:44:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.4473684210526316) internal successors, (220), 152 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 220 transitions. [2021-10-13 06:44:28,616 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 220 transitions. Word has length 26 [2021-10-13 06:44:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:28,616 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 220 transitions. [2021-10-13 06:44:28,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 220 transitions. [2021-10-13 06:44:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 06:44:28,618 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:28,618 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 06:44:28,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 06:44:28,619 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1052090052, now seen corresponding path program 1 times [2021-10-13 06:44:28,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:28,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949985342] [2021-10-13 06:44:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:28,736 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:28,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949985342] [2021-10-13 06:44:28,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949985342] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 06:44:28,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697388348] [2021-10-13 06:44:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:28,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:28,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:28,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 06:44:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:28,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 06:44:28,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:29,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:29,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697388348] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:29,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2094485977] [2021-10-13 06:44:29,479 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2021-10-13 06:44:29,480 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 06:44:29,485 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 06:44:29,491 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 06:44:29,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 06:44:29,563 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,569 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 06:44:29,570 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,571 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 06:44:29,572 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 06:44:29,573 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,574 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 06:44:29,581 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 199 [2021-10-13 06:44:29,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:44:29,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:44:29,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 06:44:29,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 06:44:29,641 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,642 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 06:44:29,642 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,643 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 06:44:29,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 06:44:29,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:44:29,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,667 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 06:44:29,670 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 173 [2021-10-13 06:44:29,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 06:44:29,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:170, output treesize:173 [2021-10-13 06:44:29,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:29,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-13 06:44:29,890 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_22| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 06:44:29,893 INFO L168 Benchmark]: Toolchain (without parser) took 3814.05 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 60.9 MB in the beginning and 70.6 MB in the end (delta: -9.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,894 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 98.6 MB. Free memory is still 77.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:44:29,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.59 ms. Allocated memory is still 98.6 MB. Free memory was 60.7 MB in the beginning and 71.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.42 ms. Allocated memory is still 98.6 MB. Free memory was 71.7 MB in the beginning and 69.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,895 INFO L168 Benchmark]: Boogie Preprocessor took 32.27 ms. Allocated memory is still 98.6 MB. Free memory was 69.6 MB in the beginning and 67.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,896 INFO L168 Benchmark]: RCFGBuilder took 1121.77 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 67.9 MB in the beginning and 95.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,896 INFO L168 Benchmark]: TraceAbstraction took 2281.78 ms. Allocated memory is still 121.6 MB. Free memory was 95.5 MB in the beginning and 70.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:29,899 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 98.6 MB. Free memory is still 77.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.59 ms. Allocated memory is still 98.6 MB. Free memory was 60.7 MB in the beginning and 71.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.42 ms. Allocated memory is still 98.6 MB. Free memory was 71.7 MB in the beginning and 69.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.27 ms. Allocated memory is still 98.6 MB. Free memory was 69.6 MB in the beginning and 67.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1121.77 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 67.9 MB in the beginning and 95.5 MB in the end (delta: -27.6 MB). Peak memory consumption was 46.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2281.78 ms. Allocated memory is still 121.6 MB. Free memory was 95.5 MB in the beginning and 70.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_22| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_22|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 06:44:29,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:44:32,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:44:32,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:44:32,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:44:32,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:44:32,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:44:32,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:44:32,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:44:32,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:44:32,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:44:32,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:44:32,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:44:32,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:44:32,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:44:32,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:44:32,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:44:32,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:44:32,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:44:32,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:44:32,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:44:32,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:44:32,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:44:32,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:44:32,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:44:32,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:44:32,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:44:32,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:44:32,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:44:32,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:44:32,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:44:32,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:44:32,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:44:32,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:44:32,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:44:32,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:44:32,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:44:32,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:44:32,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:44:32,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:44:32,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:44:32,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:44:32,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 06:44:32,502 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:44:32,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:44:32,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:44:32,504 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:44:32,504 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:44:32,504 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:44:32,505 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:44:32,505 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:44:32,505 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:44:32,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:44:32,507 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:44:32,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:44:32,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:44:32,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 06:44:32,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:44:32,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 06:44:32,509 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:44:32,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 06:44:32,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:44:32,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 06:44:32,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:44:32,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:32,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:44:32,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:44:32,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 06:44:32,511 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 06:44:32,511 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 06:44:32,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 06:44:32,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:44:32,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:44:32,512 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2021-10-13 06:44:32,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:44:32,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:44:32,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:44:32,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:44:32,903 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:44:32,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 06:44:32,970 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/477f9227d/2291ed692e984395a63d3a5510963d5a/FLAG34ae814f1 [2021-10-13 06:44:33,419 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:44:33,420 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 06:44:33,434 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/477f9227d/2291ed692e984395a63d3a5510963d5a/FLAG34ae814f1 [2021-10-13 06:44:33,797 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/data/477f9227d/2291ed692e984395a63d3a5510963d5a [2021-10-13 06:44:33,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:44:33,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:44:33,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:33,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:44:33,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:44:33,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:33" (1/1) ... [2021-10-13 06:44:33,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1779d651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:33, skipping insertion in model container [2021-10-13 06:44:33,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:33" (1/1) ... [2021-10-13 06:44:33,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:44:33,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:44:33,971 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 06:44:34,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:34,032 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:44:34,052 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 06:44:34,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:34,132 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:44:34,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34 WrapperNode [2021-10-13 06:44:34,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:34,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:34,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:44:34,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:44:34,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:34,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:44:34,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:44:34,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:44:34,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:44:34,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:44:34,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:44:34,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:44:34,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (1/1) ... [2021-10-13 06:44:34,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:34,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:44:34,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:44:34,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 06:44:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:44:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:44:34,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:44:34,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:44:34,836 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-10-13 06:44:34,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:34 BoogieIcfgContainer [2021-10-13 06:44:34,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:44:34,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:44:34,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:44:34,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:44:34,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:44:33" (1/3) ... [2021-10-13 06:44:34,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84beffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:34, skipping insertion in model container [2021-10-13 06:44:34,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:34" (2/3) ... [2021-10-13 06:44:34,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84beffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:34, skipping insertion in model container [2021-10-13 06:44:34,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:34" (3/3) ... [2021-10-13 06:44:34,851 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-10-13 06:44:34,856 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:44:34,856 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 06:44:34,925 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:44:34,936 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 06:44:34,936 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 06:44:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 93 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 06:44:34,966 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:34,967 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:34,967 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2021-10-13 06:44:34,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:34,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095201119] [2021-10-13 06:44:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:35,000 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:35,004 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:35,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 06:44:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:35,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 06:44:35,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:35,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:35,529 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:35,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095201119] [2021-10-13 06:44:35,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095201119] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:35,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:35,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 06:44:35,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101756266] [2021-10-13 06:44:35,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:35,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:35,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:35,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:35,560 INFO L87 Difference]: Start difference. First operand has 94 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 93 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:35,730 INFO L93 Difference]: Finished difference Result 269 states and 423 transitions. [2021-10-13 06:44:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:35,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 06:44:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:35,752 INFO L225 Difference]: With dead ends: 269 [2021-10-13 06:44:35,753 INFO L226 Difference]: Without dead ends: 177 [2021-10-13 06:44:35,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-10-13 06:44:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2021-10-13 06:44:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.4853801169590644) internal successors, (254), 172 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2021-10-13 06:44:35,849 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 39 [2021-10-13 06:44:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:35,849 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2021-10-13 06:44:35,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2021-10-13 06:44:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 06:44:35,855 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:35,855 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:35,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:36,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:36,068 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:36,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2021-10-13 06:44:36,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:36,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902937832] [2021-10-13 06:44:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:36,074 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:36,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:36,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:36,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 06:44:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:36,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 06:44:36,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:36,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:36,423 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:36,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902937832] [2021-10-13 06:44:36,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902937832] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:36,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:36,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 06:44:36,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002828984] [2021-10-13 06:44:36,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:36,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:36,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:36,428 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:36,548 INFO L93 Difference]: Finished difference Result 552 states and 811 transitions. [2021-10-13 06:44:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:36,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 06:44:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:36,554 INFO L225 Difference]: With dead ends: 552 [2021-10-13 06:44:36,554 INFO L226 Difference]: Without dead ends: 409 [2021-10-13 06:44:36,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-10-13 06:44:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 179. [2021-10-13 06:44:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.4576271186440677) internal successors, (258), 178 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2021-10-13 06:44:36,609 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 39 [2021-10-13 06:44:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:36,612 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2021-10-13 06:44:36,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2021-10-13 06:44:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 06:44:36,619 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:36,620 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:36,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:36,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:36,831 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash 94160760, now seen corresponding path program 1 times [2021-10-13 06:44:36,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:36,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053794848] [2021-10-13 06:44:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:36,834 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:36,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:36,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 06:44:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:36,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:36,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:37,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:37,300 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:37,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053794848] [2021-10-13 06:44:37,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053794848] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:37,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:37,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 06:44:37,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049489387] [2021-10-13 06:44:37,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:37,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:37,303 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:37,391 INFO L93 Difference]: Finished difference Result 586 states and 837 transitions. [2021-10-13 06:44:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 06:44:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:37,395 INFO L225 Difference]: With dead ends: 586 [2021-10-13 06:44:37,396 INFO L226 Difference]: Without dead ends: 423 [2021-10-13 06:44:37,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-13 06:44:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2021-10-13 06:44:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 417 states have (on average 1.3980815347721822) internal successors, (583), 418 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 583 transitions. [2021-10-13 06:44:37,436 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 583 transitions. Word has length 39 [2021-10-13 06:44:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:37,437 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 583 transitions. [2021-10-13 06:44:37,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 583 transitions. [2021-10-13 06:44:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 06:44:37,439 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:37,439 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:37,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:37,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:37,651 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1899983946, now seen corresponding path program 1 times [2021-10-13 06:44:37,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:37,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244214174] [2021-10-13 06:44:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:37,652 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:37,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:37,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 06:44:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:37,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:37,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:37,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:37,998 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:37,999 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244214174] [2021-10-13 06:44:38,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244214174] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:38,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:38,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:38,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629913003] [2021-10-13 06:44:38,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:38,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:38,004 INFO L87 Difference]: Start difference. First operand 419 states and 583 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:38,090 INFO L93 Difference]: Finished difference Result 1078 states and 1491 transitions. [2021-10-13 06:44:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-13 06:44:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:38,095 INFO L225 Difference]: With dead ends: 1078 [2021-10-13 06:44:38,095 INFO L226 Difference]: Without dead ends: 791 [2021-10-13 06:44:38,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-13 06:44:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 787. [2021-10-13 06:44:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 785 states have (on average 1.3668789808917197) internal successors, (1073), 786 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1073 transitions. [2021-10-13 06:44:38,158 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1073 transitions. Word has length 39 [2021-10-13 06:44:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:38,158 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1073 transitions. [2021-10-13 06:44:38,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1073 transitions. [2021-10-13 06:44:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 06:44:38,161 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:38,161 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:38,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:38,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:38,373 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:38,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash -909810741, now seen corresponding path program 1 times [2021-10-13 06:44:38,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:38,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889086163] [2021-10-13 06:44:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:38,374 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:38,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:38,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:38,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 06:44:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:38,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:38,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:38,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:38,790 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:38,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889086163] [2021-10-13 06:44:38,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889086163] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:38,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:38,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:38,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013885374] [2021-10-13 06:44:38,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:38,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:38,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:38,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:38,793 INFO L87 Difference]: Start difference. First operand 787 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:38,911 INFO L93 Difference]: Finished difference Result 1903 states and 2599 transitions. [2021-10-13 06:44:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 06:44:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:38,920 INFO L225 Difference]: With dead ends: 1903 [2021-10-13 06:44:38,920 INFO L226 Difference]: Without dead ends: 1285 [2021-10-13 06:44:38,921 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2021-10-13 06:44:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1241. [2021-10-13 06:44:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1239 states have (on average 1.337368845843422) internal successors, (1657), 1240 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1657 transitions. [2021-10-13 06:44:39,023 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1657 transitions. Word has length 40 [2021-10-13 06:44:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:39,023 INFO L470 AbstractCegarLoop]: Abstraction has 1241 states and 1657 transitions. [2021-10-13 06:44:39,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1657 transitions. [2021-10-13 06:44:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 06:44:39,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:39,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:39,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:39,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:39,238 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash -956850730, now seen corresponding path program 1 times [2021-10-13 06:44:39,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:39,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595491330] [2021-10-13 06:44:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:39,239 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:39,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:39,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 06:44:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:39,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:39,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:39,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:39,709 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:39,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595491330] [2021-10-13 06:44:39,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595491330] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:39,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:39,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:39,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185482858] [2021-10-13 06:44:39,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:39,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:39,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:39,712 INFO L87 Difference]: Start difference. First operand 1241 states and 1657 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:39,915 INFO L93 Difference]: Finished difference Result 3226 states and 4319 transitions. [2021-10-13 06:44:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:39,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-13 06:44:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:39,928 INFO L225 Difference]: With dead ends: 3226 [2021-10-13 06:44:39,928 INFO L226 Difference]: Without dead ends: 2035 [2021-10-13 06:44:39,930 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2021-10-13 06:44:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1995. [2021-10-13 06:44:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1993 states have (on average 1.3246362267937781) internal successors, (2640), 1994 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2640 transitions. [2021-10-13 06:44:40,101 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2640 transitions. Word has length 40 [2021-10-13 06:44:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:40,102 INFO L470 AbstractCegarLoop]: Abstraction has 1995 states and 2640 transitions. [2021-10-13 06:44:40,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2640 transitions. [2021-10-13 06:44:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 06:44:40,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:40,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:40,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:40,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:40,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1951308106, now seen corresponding path program 1 times [2021-10-13 06:44:40,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:40,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317819053] [2021-10-13 06:44:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:40,322 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:40,327 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:40,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 06:44:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:40,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:40,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:40,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:40,788 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:40,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317819053] [2021-10-13 06:44:40,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317819053] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:40,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:40,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:40,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489129424] [2021-10-13 06:44:40,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:40,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:40,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:40,791 INFO L87 Difference]: Start difference. First operand 1995 states and 2640 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:41,005 INFO L93 Difference]: Finished difference Result 4375 states and 5766 transitions. [2021-10-13 06:44:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-13 06:44:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:41,022 INFO L225 Difference]: With dead ends: 4375 [2021-10-13 06:44:41,023 INFO L226 Difference]: Without dead ends: 2409 [2021-10-13 06:44:41,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2021-10-13 06:44:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2365. [2021-10-13 06:44:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2365 states, 2363 states have (on average 1.312738044858231) internal successors, (3102), 2364 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3102 transitions. [2021-10-13 06:44:41,239 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3102 transitions. Word has length 45 [2021-10-13 06:44:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:41,240 INFO L470 AbstractCegarLoop]: Abstraction has 2365 states and 3102 transitions. [2021-10-13 06:44:41,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3102 transitions. [2021-10-13 06:44:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 06:44:41,242 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:41,242 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:41,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:41,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:41,454 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:41,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1660743978, now seen corresponding path program 1 times [2021-10-13 06:44:41,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:41,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622120917] [2021-10-13 06:44:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:41,455 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:41,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:41,456 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:41,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 06:44:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:41,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 06:44:41,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:41,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:41,877 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:41,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622120917] [2021-10-13 06:44:41,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622120917] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:41,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:41,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-13 06:44:41,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740460544] [2021-10-13 06:44:41,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:41,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:41,884 INFO L87 Difference]: Start difference. First operand 2365 states and 3102 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:42,104 INFO L93 Difference]: Finished difference Result 2873 states and 3768 transitions. [2021-10-13 06:44:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:42,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-13 06:44:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:42,121 INFO L225 Difference]: With dead ends: 2873 [2021-10-13 06:44:42,122 INFO L226 Difference]: Without dead ends: 2871 [2021-10-13 06:44:42,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2021-10-13 06:44:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2363. [2021-10-13 06:44:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.3077900084674006) internal successors, (3089), 2362 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3089 transitions. [2021-10-13 06:44:42,364 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3089 transitions. Word has length 46 [2021-10-13 06:44:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:42,365 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3089 transitions. [2021-10-13 06:44:42,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3089 transitions. [2021-10-13 06:44:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 06:44:42,367 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:42,367 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:42,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:42,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:42,580 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2021-10-13 06:44:42,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:42,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613351497] [2021-10-13 06:44:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:42,582 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:42,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:42,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 06:44:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:42,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 06:44:42,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:43,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:43,428 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:43,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613351497] [2021-10-13 06:44:43,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613351497] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:43,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580251220] [2021-10-13 06:44:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:43,429 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 06:44:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 06:44:43,434 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 06:44:43,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-10-13 06:44:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:43,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 06:44:43,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:44,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:44,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [580251220] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:44,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505532277] [2021-10-13 06:44:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:44,340 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:44,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:44,342 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 06:44:44,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-13 06:44:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:44,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 06:44:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:44,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:45,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505532277] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 06:44:45,174 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 06:44:45,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5, 4, 5, 4] total 7 [2021-10-13 06:44:45,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621603184] [2021-10-13 06:44:45,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:45,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:45,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:45,176 INFO L87 Difference]: Start difference. First operand 2363 states and 3089 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:45,705 INFO L93 Difference]: Finished difference Result 6487 states and 8544 transitions. [2021-10-13 06:44:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:44:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-13 06:44:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:45,747 INFO L225 Difference]: With dead ends: 6487 [2021-10-13 06:44:45,747 INFO L226 Difference]: Without dead ends: 6485 [2021-10-13 06:44:45,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.2ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2021-10-13 06:44:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 4719. [2021-10-13 06:44:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4719 states, 4718 states have (on average 1.3130563798219586) internal successors, (6195), 4718 states have internal predecessors, (6195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 6195 transitions. [2021-10-13 06:44:46,183 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 6195 transitions. Word has length 47 [2021-10-13 06:44:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:46,183 INFO L470 AbstractCegarLoop]: Abstraction has 4719 states and 6195 transitions. [2021-10-13 06:44:46,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 6195 transitions. [2021-10-13 06:44:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 06:44:46,185 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:46,186 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:46,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:46,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:46,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:46,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 06:44:46,798 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2021-10-13 06:44:46,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:46,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658097749] [2021-10-13 06:44:46,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 06:44:46,799 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:46,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:46,800 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:46,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 06:44:47,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 06:44:47,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 06:44:47,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:47,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:47,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:47,335 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:47,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658097749] [2021-10-13 06:44:47,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658097749] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:47,336 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:47,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:47,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497777145] [2021-10-13 06:44:47,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:47,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:47,340 INFO L87 Difference]: Start difference. First operand 4719 states and 6195 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:47,657 INFO L93 Difference]: Finished difference Result 7135 states and 9408 transitions. [2021-10-13 06:44:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-13 06:44:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:47,674 INFO L225 Difference]: With dead ends: 7135 [2021-10-13 06:44:47,674 INFO L226 Difference]: Without dead ends: 2879 [2021-10-13 06:44:47,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2021-10-13 06:44:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2847. [2021-10-13 06:44:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2846 states have (on average 1.2912860154602952) internal successors, (3675), 2846 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3675 transitions. [2021-10-13 06:44:47,941 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3675 transitions. Word has length 50 [2021-10-13 06:44:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:47,942 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3675 transitions. [2021-10-13 06:44:47,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3675 transitions. [2021-10-13 06:44:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 06:44:47,944 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:47,944 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:47,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:48,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:48,157 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2021-10-13 06:44:48,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:48,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59655169] [2021-10-13 06:44:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:48,158 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:48,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:48,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:48,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 06:44:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:48,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:48,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:48,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:48,672 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:48,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59655169] [2021-10-13 06:44:48,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59655169] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:48,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:48,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 06:44:48,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444886044] [2021-10-13 06:44:48,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:48,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:48,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:48,675 INFO L87 Difference]: Start difference. First operand 2847 states and 3675 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:49,212 INFO L93 Difference]: Finished difference Result 10697 states and 13742 transitions. [2021-10-13 06:44:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 06:44:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:49,260 INFO L225 Difference]: With dead ends: 10697 [2021-10-13 06:44:49,261 INFO L226 Difference]: Without dead ends: 7927 [2021-10-13 06:44:49,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2021-10-13 06:44:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 5419. [2021-10-13 06:44:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5418 states have (on average 1.2655961609449982) internal successors, (6857), 5418 states have internal predecessors, (6857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 6857 transitions. [2021-10-13 06:44:49,836 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 6857 transitions. Word has length 54 [2021-10-13 06:44:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:49,836 INFO L470 AbstractCegarLoop]: Abstraction has 5419 states and 6857 transitions. [2021-10-13 06:44:49,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 6857 transitions. [2021-10-13 06:44:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 06:44:49,840 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:49,840 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:49,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:50,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:50,052 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash -133219174, now seen corresponding path program 1 times [2021-10-13 06:44:50,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:50,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827383714] [2021-10-13 06:44:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:50,054 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:50,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:50,055 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:50,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 06:44:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:50,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:50,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:50,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:50,622 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:50,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827383714] [2021-10-13 06:44:50,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827383714] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:50,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:50,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 06:44:50,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619933034] [2021-10-13 06:44:50,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:50,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:50,625 INFO L87 Difference]: Start difference. First operand 5419 states and 6857 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:51,042 INFO L93 Difference]: Finished difference Result 10341 states and 13103 transitions. [2021-10-13 06:44:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:51,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-13 06:44:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:51,068 INFO L225 Difference]: With dead ends: 10341 [2021-10-13 06:44:51,068 INFO L226 Difference]: Without dead ends: 5421 [2021-10-13 06:44:51,075 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2021-10-13 06:44:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5419. [2021-10-13 06:44:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5418 states have (on average 1.2390180878552972) internal successors, (6713), 5418 states have internal predecessors, (6713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 6713 transitions. [2021-10-13 06:44:51,625 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 6713 transitions. Word has length 62 [2021-10-13 06:44:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:51,626 INFO L470 AbstractCegarLoop]: Abstraction has 5419 states and 6713 transitions. [2021-10-13 06:44:51,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 6713 transitions. [2021-10-13 06:44:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-13 06:44:51,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:51,633 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:51,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:51,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:51,845 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash -69278234, now seen corresponding path program 1 times [2021-10-13 06:44:51,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:51,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317663723] [2021-10-13 06:44:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:51,847 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:51,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:51,848 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:51,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-10-13 06:44:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:52,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 06:44:52,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 06:44:52,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 06:44:52,676 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:52,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317663723] [2021-10-13 06:44:52,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317663723] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:52,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:52,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-13 06:44:52,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411092054] [2021-10-13 06:44:52,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:44:52,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:52,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:44:52,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:52,678 INFO L87 Difference]: Start difference. First operand 5419 states and 6713 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:53,102 INFO L93 Difference]: Finished difference Result 9319 states and 11435 transitions. [2021-10-13 06:44:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:53,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-10-13 06:44:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:53,110 INFO L225 Difference]: With dead ends: 9319 [2021-10-13 06:44:53,111 INFO L226 Difference]: Without dead ends: 4041 [2021-10-13 06:44:53,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-10-13 06:44:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4041 states. [2021-10-13 06:44:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4041 to 3365. [2021-10-13 06:44:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3364 states have (on average 1.2235434007134365) internal successors, (4116), 3364 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4116 transitions. [2021-10-13 06:44:53,432 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4116 transitions. Word has length 89 [2021-10-13 06:44:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:53,432 INFO L470 AbstractCegarLoop]: Abstraction has 3365 states and 4116 transitions. [2021-10-13 06:44:53,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4116 transitions. [2021-10-13 06:44:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-13 06:44:53,437 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:53,437 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:53,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:53,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:53,650 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1573597234, now seen corresponding path program 1 times [2021-10-13 06:44:53,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:53,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529208587] [2021-10-13 06:44:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:53,652 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:53,654 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:53,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-10-13 06:44:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:54,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:54,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-13 06:44:54,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-13 06:44:54,488 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:54,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529208587] [2021-10-13 06:44:54,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529208587] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:54,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:54,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:54,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989712245] [2021-10-13 06:44:54,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:54,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:54,490 INFO L87 Difference]: Start difference. First operand 3365 states and 4116 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:54,719 INFO L93 Difference]: Finished difference Result 3367 states and 4117 transitions. [2021-10-13 06:44:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-10-13 06:44:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:54,726 INFO L225 Difference]: With dead ends: 3367 [2021-10-13 06:44:54,726 INFO L226 Difference]: Without dead ends: 3021 [2021-10-13 06:44:54,728 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-10-13 06:44:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3021. [2021-10-13 06:44:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 3020 states have (on average 1.228476821192053) internal successors, (3710), 3020 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3710 transitions. [2021-10-13 06:44:55,040 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3710 transitions. Word has length 91 [2021-10-13 06:44:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:55,042 INFO L470 AbstractCegarLoop]: Abstraction has 3021 states and 3710 transitions. [2021-10-13 06:44:55,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3710 transitions. [2021-10-13 06:44:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 06:44:55,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:55,046 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:55,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:55,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:55,268 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1884645187, now seen corresponding path program 1 times [2021-10-13 06:44:55,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:55,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261815476] [2021-10-13 06:44:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:55,269 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:55,270 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:55,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-10-13 06:44:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:55,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:55,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-13 06:44:55,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-13 06:44:56,128 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:56,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261815476] [2021-10-13 06:44:56,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261815476] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:56,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:56,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 06:44:56,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823414940] [2021-10-13 06:44:56,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:56,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:56,129 INFO L87 Difference]: Start difference. First operand 3021 states and 3710 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:56,534 INFO L93 Difference]: Finished difference Result 7181 states and 8858 transitions. [2021-10-13 06:44:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 06:44:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:56,544 INFO L225 Difference]: With dead ends: 7181 [2021-10-13 06:44:56,544 INFO L226 Difference]: Without dead ends: 4196 [2021-10-13 06:44:56,548 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4196 states. [2021-10-13 06:44:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4196 to 2291. [2021-10-13 06:44:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 1.2231441048034934) internal successors, (2801), 2290 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2801 transitions. [2021-10-13 06:44:56,821 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2801 transitions. Word has length 100 [2021-10-13 06:44:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:56,822 INFO L470 AbstractCegarLoop]: Abstraction has 2291 states and 2801 transitions. [2021-10-13 06:44:56,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2801 transitions. [2021-10-13 06:44:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 06:44:56,824 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:56,824 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:56,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:57,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:57,025 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:57,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:57,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1095317235, now seen corresponding path program 1 times [2021-10-13 06:44:57,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:57,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165090036] [2021-10-13 06:44:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:57,026 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:57,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:57,026 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:57,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-10-13 06:44:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:57,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:57,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:57,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:57,928 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:57,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165090036] [2021-10-13 06:44:57,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165090036] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:57,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:57,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:57,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250705978] [2021-10-13 06:44:57,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:57,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:57,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:57,932 INFO L87 Difference]: Start difference. First operand 2291 states and 2801 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:58,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:58,143 INFO L93 Difference]: Finished difference Result 4504 states and 5525 transitions. [2021-10-13 06:44:58,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:58,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-10-13 06:44:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:58,148 INFO L225 Difference]: With dead ends: 4504 [2021-10-13 06:44:58,149 INFO L226 Difference]: Without dead ends: 2404 [2021-10-13 06:44:58,152 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2021-10-13 06:44:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2088. [2021-10-13 06:44:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.219932918064207) internal successors, (2546), 2087 states have internal predecessors, (2546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2546 transitions. [2021-10-13 06:44:58,387 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2546 transitions. Word has length 102 [2021-10-13 06:44:58,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:58,388 INFO L470 AbstractCegarLoop]: Abstraction has 2088 states and 2546 transitions. [2021-10-13 06:44:58,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2546 transitions. [2021-10-13 06:44:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 06:44:58,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:58,390 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:58,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-10-13 06:44:58,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:44:58,592 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:44:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:58,592 INFO L82 PathProgramCache]: Analyzing trace with hash 2042293350, now seen corresponding path program 1 times [2021-10-13 06:44:58,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:44:58,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46911587] [2021-10-13 06:44:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:58,593 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:44:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:44:58,594 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:44:58,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-10-13 06:44:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:59,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:44:59,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:44:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 06:44:59,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:44:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 06:44:59,621 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:44:59,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46911587] [2021-10-13 06:44:59,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46911587] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:59,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:59,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:44:59,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168634552] [2021-10-13 06:44:59,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:59,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:44:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:59,624 INFO L87 Difference]: Start difference. First operand 2088 states and 2546 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:59,792 INFO L93 Difference]: Finished difference Result 3902 states and 4783 transitions. [2021-10-13 06:44:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:59,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-10-13 06:44:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:59,796 INFO L225 Difference]: With dead ends: 3902 [2021-10-13 06:44:59,796 INFO L226 Difference]: Without dead ends: 2069 [2021-10-13 06:44:59,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2021-10-13 06:44:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1902. [2021-10-13 06:44:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 1.199894792214624) internal successors, (2281), 1901 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2281 transitions. [2021-10-13 06:44:59,987 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2281 transitions. Word has length 104 [2021-10-13 06:44:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:59,987 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2281 transitions. [2021-10-13 06:44:59,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2281 transitions. [2021-10-13 06:44:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-13 06:44:59,990 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:59,990 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:00,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:00,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:45:00,197 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash 795979083, now seen corresponding path program 1 times [2021-10-13 06:45:00,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:45:00,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962185089] [2021-10-13 06:45:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:00,198 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:45:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:45:00,199 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:45:00,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-10-13 06:45:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:00,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 06:45:00,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 06:45:00,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-13 06:45:01,205 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:45:01,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962185089] [2021-10-13 06:45:01,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962185089] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:45:01,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:45:01,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 06:45:01,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760528241] [2021-10-13 06:45:01,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:45:01,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:45:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:45:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:45:01,207 INFO L87 Difference]: Start difference. First operand 1902 states and 2281 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:01,531 INFO L93 Difference]: Finished difference Result 4835 states and 5730 transitions. [2021-10-13 06:45:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:45:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-10-13 06:45:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:01,536 INFO L225 Difference]: With dead ends: 4835 [2021-10-13 06:45:01,536 INFO L226 Difference]: Without dead ends: 2623 [2021-10-13 06:45:01,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:45:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2021-10-13 06:45:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 1476. [2021-10-13 06:45:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 1.1952542372881356) internal successors, (1763), 1475 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1763 transitions. [2021-10-13 06:45:01,720 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1763 transitions. Word has length 105 [2021-10-13 06:45:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:01,721 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 1763 transitions. [2021-10-13 06:45:01,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1763 transitions. [2021-10-13 06:45:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-13 06:45:01,725 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:01,725 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:01,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:01,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:45:01,939 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1149164593, now seen corresponding path program 1 times [2021-10-13 06:45:01,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:45:01,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918819319] [2021-10-13 06:45:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:01,940 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:45:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:45:01,942 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:45:01,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-10-13 06:45:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:02,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:45:02,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-13 06:45:02,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-13 06:45:03,187 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:45:03,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918819319] [2021-10-13 06:45:03,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918819319] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:45:03,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:45:03,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:45:03,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941657862] [2021-10-13 06:45:03,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:45:03,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:45:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:45:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:03,189 INFO L87 Difference]: Start difference. First operand 1476 states and 1763 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:03,261 INFO L93 Difference]: Finished difference Result 2072 states and 2468 transitions. [2021-10-13 06:45:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:45:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2021-10-13 06:45:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:03,262 INFO L225 Difference]: With dead ends: 2072 [2021-10-13 06:45:03,262 INFO L226 Difference]: Without dead ends: 650 [2021-10-13 06:45:03,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-13 06:45:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 649. [2021-10-13 06:45:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.1589506172839505) internal successors, (751), 648 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 751 transitions. [2021-10-13 06:45:03,340 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 751 transitions. Word has length 163 [2021-10-13 06:45:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:03,341 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 751 transitions. [2021-10-13 06:45:03,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 751 transitions. [2021-10-13 06:45:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-13 06:45:03,343 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:03,343 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:03,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:03,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:45:03,544 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1078560962, now seen corresponding path program 1 times [2021-10-13 06:45:03,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:45:03,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88329639] [2021-10-13 06:45:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:03,545 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:45:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:45:03,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:45:03,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-10-13 06:45:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:04,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:45:04,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-10-13 06:45:04,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-10-13 06:45:04,820 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:45:04,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88329639] [2021-10-13 06:45:04,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88329639] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:45:04,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:45:04,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:45:04,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971248210] [2021-10-13 06:45:04,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:45:04,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:45:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:45:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:04,822 INFO L87 Difference]: Start difference. First operand 649 states and 751 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:04,890 INFO L93 Difference]: Finished difference Result 1223 states and 1423 transitions. [2021-10-13 06:45:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:45:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2021-10-13 06:45:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:04,899 INFO L225 Difference]: With dead ends: 1223 [2021-10-13 06:45:04,899 INFO L226 Difference]: Without dead ends: 640 [2021-10-13 06:45:04,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2021-10-13 06:45:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 637. [2021-10-13 06:45:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.1383647798742138) internal successors, (724), 636 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 724 transitions. [2021-10-13 06:45:04,987 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 724 transitions. Word has length 166 [2021-10-13 06:45:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:04,987 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 724 transitions. [2021-10-13 06:45:04,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 724 transitions. [2021-10-13 06:45:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-13 06:45:04,990 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:45:04,991 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:45:05,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-10-13 06:45:05,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:45:05,204 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 06:45:05,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:45:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1125750556, now seen corresponding path program 1 times [2021-10-13 06:45:05,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 06:45:05,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718792899] [2021-10-13 06:45:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:45:05,206 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 06:45:05,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 06:45:05,207 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 06:45:05,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-10-13 06:45:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:45:05,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 06:45:05,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 06:45:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 06:45:06,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 06:45:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-10-13 06:45:06,558 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 06:45:06,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718792899] [2021-10-13 06:45:06,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718792899] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 06:45:06,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:45:06,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 06:45:06,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961809135] [2021-10-13 06:45:06,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:45:06,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 06:45:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:45:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:06,560 INFO L87 Difference]: Start difference. First operand 637 states and 724 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:45:06,600 INFO L93 Difference]: Finished difference Result 835 states and 938 transitions. [2021-10-13 06:45:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:45:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2021-10-13 06:45:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:45:06,601 INFO L225 Difference]: With dead ends: 835 [2021-10-13 06:45:06,601 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 06:45:06,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:45:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 06:45:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 06:45:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 06:45:06,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 167 [2021-10-13 06:45:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:45:06,603 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 06:45:06,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:45:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 06:45:06,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 06:45:06,605 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:45:06,606 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 06:45:06,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-10-13 06:45:06,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 06:45:06,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 06:45:06,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:07,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:08,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,458 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:09,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 06:45:34,307 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 06:45:34,308 INFO L857 garLoopResultBuilder]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2021-10-13 06:45:34,308 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 267 271) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,308 INFO L857 garLoopResultBuilder]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2021-10-13 06:45:34,308 INFO L857 garLoopResultBuilder]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2021-10-13 06:45:34,309 INFO L853 garLoopResultBuilder]: At program point L69(lines 53 71) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,309 INFO L853 garLoopResultBuilder]: At program point L69-1(lines 53 71) the Hoare annotation is: (let ((.cse14 (= (_ bv1 32) ~q_read_ev~0)) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse20 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse12 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse15 (= ~p_num_write~0 (_ bv1 32))) (.cse16 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse17 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse10) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse15 .cse16 .cse2 .cse17 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse19 (= ~q_req_up~0 (_ bv0 32)) .cse10) (and .cse13 .cse0 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse20 .cse9 .cse11 .cse12 .cse10 .cse14) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse20 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse17 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10))) [2021-10-13 06:45:34,309 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 06:45:34,309 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 256) no Hoare annotation was computed. [2021-10-13 06:45:34,310 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2021-10-13 06:45:34,310 INFO L853 garLoopResultBuilder]: At program point L466(lines 457 468) the Hoare annotation is: (not (= (_ bv0 32) ~q_read_ev~0)) [2021-10-13 06:45:34,310 INFO L857 garLoopResultBuilder]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2021-10-13 06:45:34,310 INFO L857 garLoopResultBuilder]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2021-10-13 06:45:34,310 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 128) no Hoare annotation was computed. [2021-10-13 06:45:34,311 INFO L853 garLoopResultBuilder]: At program point L87(lines 75 89) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32)) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,311 INFO L853 garLoopResultBuilder]: At program point L87-1(lines 75 89) the Hoare annotation is: (let ((.cse19 (= ~p_num_write~0 (_ bv1 32))) (.cse20 (= ~c_num_read~0 (_ bv0 32))) (.cse21 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse7 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= (_ bv1 32) ~q_read_ev~0)) (.cse17 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse18 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse14 (= ~q_free~0 (_ bv0 32))) (.cse15 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= ~c_dr_pc~0 (_ bv1 32))) (.cse22 (= (_ bv1 32) ~q_write_ev~0)) (.cse16 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (or (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse4 .cse5 .cse14 .cse15 .cse6 .cse8 .cse16) (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse4 .cse5 .cse15 .cse6 .cse8 .cse9 .cse10 .cse16)) .cse2) (and .cse17 .cse0 .cse2 .cse12 .cse3 .cse13 .cse4 .cse5 .cse18 .cse14 .cse15 .cse6 .cse8 .cse16) (and .cse0 .cse1 .cse19 .cse2 .cse12 .cse20 .cse3 .cse13 .cse4 .cse5 .cse14 .cse15 .cse6 .cse21 .cse16) (and .cse0 .cse19 .cse2 .cse12 .cse20 .cse3 .cse13 .cse4 .cse14 .cse15 .cse6 .cse21 (= ~q_req_up~0 (_ bv0 32)) .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse17 .cse0 (not .cse22) .cse2 .cse3 .cse4 .cse5 (= ~p_dw_st~0 (_ bv0 32)) .cse8 .cse9 .cse10 .cse11) (and .cse17 .cse0 .cse12 .cse3 .cse13 .cse4 .cse5 .cse18 .cse14 .cse15 .cse6 .cse8 .cse22 .cse16))) [2021-10-13 06:45:34,311 INFO L853 garLoopResultBuilder]: At program point L434(lines 397 439) the Hoare annotation is: (not (= (_ bv0 32) ~q_read_ev~0)) [2021-10-13 06:45:34,311 INFO L853 garLoopResultBuilder]: At program point L88(lines 72 90) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32)) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,312 INFO L853 garLoopResultBuilder]: At program point L88-1(lines 72 90) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse20 (= (_ bv1 32) ~q_read_ev~0)) (.cse22 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse23 (= (_ bv1 32) ~q_write_ev~0)) (.cse21 (= ~p_dw_pc~0 (_ bv1 32))) (.cse16 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= (_ bv2 32) ~q_write_ev~0)) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse15 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse10 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse11 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~c_dr_pc~0 (_ bv1 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~q_req_up~0 (_ bv0 32)) .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse8 .cse15 .cse11 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse15 .cse22 .cse9 .cse10 .cse11 .cse17 .cse13) (and .cse21 .cse0 (not .cse23) .cse2 .cse5 .cse6 .cse8 .cse15 (= ~p_dw_st~0 (_ bv0 32)) .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse3 .cse5 .cse7 .cse8 .cse15 .cse22 .cse9 .cse10 .cse11 .cse17 .cse23 .cse13) (and .cse21 .cse0 .cse14 .cse2 .cse5 .cse6 .cse8 .cse15 .cse11 .cse16 .cse17 .cse18 .cse19) (and (or (and .cse0 .cse14 .cse3 .cse5 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse17 .cse13) (and .cse0 .cse14 .cse3 .cse5 .cse7 .cse8 .cse15 .cse10 .cse11 .cse17 .cse18 .cse19 .cse13)) .cse2 .cse6))) [2021-10-13 06:45:34,312 INFO L857 garLoopResultBuilder]: For program point L336(lines 336 340) no Hoare annotation was computed. [2021-10-13 06:45:34,312 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2021-10-13 06:45:34,312 INFO L857 garLoopResultBuilder]: For program point L386(lines 386 391) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 127) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 66) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L857 garLoopResultBuilder]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L857 garLoopResultBuilder]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L857 garLoopResultBuilder]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2021-10-13 06:45:34,313 INFO L853 garLoopResultBuilder]: At program point L272-1(lines 263 280) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,314 INFO L857 garLoopResultBuilder]: For program point L173(lines 172 203) no Hoare annotation was computed. [2021-10-13 06:45:34,314 INFO L853 garLoopResultBuilder]: At program point L272-3(lines 263 280) the Hoare annotation is: (let ((.cse9 (= ~p_num_write~0 (_ bv1 32))) (.cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse11 (= ~c_num_read~0 (_ bv0 32))) (.cse12 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse15 (= ~q_free~0 (_ bv1 32))) (.cse16 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= ~c_dr_pc~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse6 .cse7 .cse13 (= ~q_req_up~0 (_ bv0 32)) .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 (not (= (_ bv0 32) ~q_read_ev~0)) .cse8 .cse15 .cse16) (and .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6 .cse7 .cse8))) [2021-10-13 06:45:34,314 INFO L853 garLoopResultBuilder]: At program point L454(lines 440 456) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 06:45:34,314 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-10-13 06:45:34,315 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 63) no Hoare annotation was computed. [2021-10-13 06:45:34,315 INFO L857 garLoopResultBuilder]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2021-10-13 06:45:34,315 INFO L853 garLoopResultBuilder]: At program point L372(lines 324 377) the Hoare annotation is: (let ((.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse18 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse8 (= ~c_dr_pc~0 (_ bv1 32))) (.cse16 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= (_ bv2 32) ~q_write_ev~0)) (.cse9 (= ~p_num_write~0 (_ bv1 32))) (.cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse11 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse12 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 .cse12 .cse5 .cse6 .cse7 .cse13 (= ~q_req_up~0 (_ bv0 32)) .cse14) (and .cse0 .cse1 .cse15 .cse4 .cse5 .cse7 (not (= (_ bv0 32) ~q_read_ev~0)) .cse8 .cse16 .cse17) (and .cse1 .cse15 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8) (and .cse1 .cse15 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse16 .cse17) (and .cse1 .cse15 .cse9 .cse10 .cse3 .cse11 .cse4 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14))) [2021-10-13 06:45:34,315 INFO L857 garLoopResultBuilder]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2021-10-13 06:45:34,316 INFO L853 garLoopResultBuilder]: At program point L356(lines 331 371) the Hoare annotation is: (let ((.cse21 (= ~q_req_up~0 (_ bv1 32)))) (let ((.cse10 (= ~p_num_write~0 (_ bv1 32))) (.cse12 (= ~c_num_read~0 (_ bv0 32))) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse24 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse26 (= ~p_dw_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse25 (= ~p_dw_st~0 (_ bv0 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse22 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse20 (not .cse21)) (.cse6 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse4 .cse5 .cse8 (not (= (_ bv0 32) ~q_read_ev~0)) .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse17 .cse10 .cse11 .cse21 .cse3 .cse12 .cse4 .cse13 .cse22 .cse7 .cse8 .cse23 .cse14 .cse16) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse20 .cse8 .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse16) (and .cse1 .cse17 .cse11 .cse3 .cse12 .cse4 .cse13 (= ~p_num_write~0 (_ bv0 32)) .cse24 .cse25 .cse14 .cse15 .cse18 .cse16 .cse26) (and .cse1 .cse17 .cse11 .cse3 .cse4 .cse13 .cse22 .cse5 .cse24 .cse25 .cse9 .cse23 .cse15 .cse18 .cse19 .cse16 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)) .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse22 .cse5 .cse25 .cse9 .cse23 .cse18 .cse19) (and .cse0 .cse1 .cse17 .cse3 .cse4 .cse22 .cse20 .cse6 .cse7 .cse8 .cse9 .cse23)))) [2021-10-13 06:45:34,316 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-10-13 06:45:34,316 INFO L853 garLoopResultBuilder]: At program point L290-3(lines 281 298) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~q_write_ev~0)) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse15 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse17 (= ~c_dr_pc~0 (_ bv1 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 (_ bv0 32)) .cse12) (and .cse13 .cse0 .cse14 .cse4 .cse6 .cse15 .cse16 .cse9 .cse10 .cse17) (and (or (and .cse0 .cse14 .cse4 .cse6 .cse8 .cse15 .cse9 .cse10 .cse17) (and .cse0 .cse14 .cse4 .cse6 .cse8 .cse15 .cse10 .cse17 .cse18 .cse19)) .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse15 .cse16 .cse9 .cse10 .cse17 .cse12) (and .cse13 .cse0 .cse14 .cse6 .cse8 .cse15 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse17 .cse18 .cse19 .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse15 (= ~p_dw_st~0 (_ bv0 32)) .cse17 .cse18 .cse19 .cse12))) [2021-10-13 06:45:34,316 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 85) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2021-10-13 06:45:34,317 INFO L857 garLoopResultBuilder]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2021-10-13 06:45:34,318 INFO L857 garLoopResultBuilder]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2021-10-13 06:45:34,318 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2021-10-13 06:45:34,318 INFO L857 garLoopResultBuilder]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2021-10-13 06:45:34,318 INFO L857 garLoopResultBuilder]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2021-10-13 06:45:34,318 INFO L857 garLoopResultBuilder]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2021-10-13 06:45:34,319 INFO L853 garLoopResultBuilder]: At program point L341(lines 331 371) the Hoare annotation is: (let ((.cse14 (= ~q_req_up~0 (_ bv1 32)))) (let ((.cse5 (not .cse14)) (.cse12 (= ~p_num_write~0 (_ bv1 32))) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse20 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse17 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse24 (= ~p_last_write~0 ~c_last_read~0)) (.cse25 (= ~p_dw_st~0 (_ bv0 32))) (.cse19 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse26 (= ~q_req_up~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse22 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32))) (.cse27 (= ~p_dw_pc~0 (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse23 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse18 (= ~q_free~0 (_ bv0 32))) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= ~c_dr_pc~0 (_ bv1 32))) (.cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse13 .cse14 .cse2 .cse15 .cse3 .cse16 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse22) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse23 .cse18 .cse6 .cse7 .cse19 .cse22) (and .cse0 .cse1 .cse12 .cse13 .cse2 .cse15 .cse3 .cse16 .cse4 .cse18 .cse6 .cse8 .cse20 .cse21) (and .cse0 .cse1 .cse13 .cse2 .cse15 .cse3 .cse16 .cse17 (= ~p_num_write~0 (_ bv0 32)) .cse24 .cse25 .cse19 .cse20 .cse26 .cse9 .cse21 .cse22 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8) (and .cse0 .cse12 .cse28 .cse13 .cse2 .cse15 .cse3 .cse16 .cse4 .cse18 .cse6 .cse8 .cse20 .cse26 .cse21) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 (not (= (_ bv0 32) ~q_read_ev~0)) .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse28 .cse2 .cse3 .cse17 .cse4 .cse25 .cse7 .cse19 .cse9 .cse10 .cse22) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse16 .cse17 .cse4 .cse24 .cse25 .cse7 .cse19 .cse26 .cse9 .cse10 .cse21 .cse22 .cse27) (and .cse11 .cse0 .cse28 .cse2 .cse3 .cse4 .cse23 .cse18 .cse6 .cse7 .cse8)))) [2021-10-13 06:45:34,319 INFO L857 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-10-13 06:45:34,319 INFO L857 garLoopResultBuilder]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2021-10-13 06:45:34,319 INFO L853 garLoopResultBuilder]: At program point L259(lines 246 261) the Hoare annotation is: (let ((.cse25 (= ~q_req_up~0 (_ bv1 32)))) (let ((.cse21 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse24 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_num_write~0 (_ bv1 32))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse12 (= ~c_num_read~0 (_ bv0 32))) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse20 (not .cse25)) (.cse6 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse22 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse4 .cse5 .cse8 (not (= (_ bv0 32) ~q_read_ev~0)) .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse9) (and .cse1 .cse17 .cse11 .cse3 .cse4 .cse13 .cse5 .cse21 .cse22 .cse9 .cse23 .cse15 .cse18 .cse19 .cse16 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)) .cse24) (and .cse1 .cse17 .cse11 .cse3 .cse12 .cse4 .cse13 (= ~p_num_write~0 (_ bv0 32)) .cse21 .cse22 .cse23 .cse14 .cse15 .cse18 .cse16 .cse24) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse20 .cse8 .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse16) (and .cse0 .cse1 .cse17 .cse10 .cse11 .cse25 .cse3 .cse12 .cse4 .cse13 .cse7 .cse8 .cse23 .cse14 .cse16) (and .cse0 .cse1 .cse17 .cse3 .cse4 .cse20 .cse6 .cse7 .cse8 .cse9 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse9 .cse23 .cse18 .cse19)))) [2021-10-13 06:45:34,320 INFO L853 garLoopResultBuilder]: At program point L259-1(lines 246 261) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse14 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse15 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~c_dr_pc~0 (_ bv1 32))) (.cse20 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 (_ bv0 32)) .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse14 .cse15 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse10 .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse17 .cse6 .cse8 .cse14 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse14 (= ~p_dw_st~0 (_ bv0 32)) .cse16 .cse20 .cse18 .cse19 .cse12) (and .cse13 .cse0 .cse17 .cse4 .cse6 .cse14 .cse15 .cse9 .cse10 .cse16 .cse20))) [2021-10-13 06:45:34,320 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 06:45:34,320 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 06:45:34,320 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 06:45:34,321 INFO L853 garLoopResultBuilder]: At program point L260(lines 243 262) the Hoare annotation is: (let ((.cse26 (= ~q_req_up~0 (_ bv1 32)))) (let ((.cse10 (= ~p_num_write~0 (_ bv1 32))) (.cse12 (= ~c_num_read~0 (_ bv0 32))) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse24 (= ~p_dw_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse22 (= ~p_dw_st~0 (_ bv0 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse20 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse25 (not .cse26)) (.cse6 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse2 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse4 .cse5 .cse8 (not (= (_ bv0 32) ~q_read_ev~0)) .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse11 .cse3 .cse12 .cse4 .cse13 .cse20 (= ~p_num_write~0 (_ bv0 32)) .cse21 .cse22 .cse23 .cse14 .cse15 .cse18 .cse16 .cse24) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse25 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse17 .cse10 .cse11 .cse26 .cse3 .cse12 .cse4 .cse13 .cse20 .cse7 .cse8 .cse23 .cse14 .cse16) (and .cse1 .cse17 .cse3 .cse4 .cse5 .cse25 .cse8 .cse9 .cse18 .cse19) (and .cse1 .cse17 .cse10 .cse11 .cse3 .cse12 .cse4 .cse13 .cse5 .cse7 .cse8 .cse14 .cse16) (and .cse1 .cse17 .cse11 .cse3 .cse4 .cse13 .cse20 .cse5 .cse21 .cse22 .cse9 .cse23 .cse15 .cse18 .cse19 .cse16 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)) .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse22 .cse9 .cse23 .cse18 .cse19) (and .cse0 .cse1 .cse17 .cse3 .cse4 .cse20 .cse25 .cse6 .cse7 .cse8 .cse9 .cse23)))) [2021-10-13 06:45:34,321 INFO L853 garLoopResultBuilder]: At program point L260-1(lines 243 262) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse20 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse14 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse15 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~c_dr_pc~0 (_ bv1 32))) (.cse21 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 (_ bv0 32)) .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse14 .cse15 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse10 .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse17 .cse6 .cse8 .cse14 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse20 .cse8 .cse14 (= ~p_dw_st~0 (_ bv0 32)) .cse16 .cse21 .cse18 .cse19 .cse12) (and .cse13 .cse0 .cse17 .cse4 .cse6 .cse20 .cse14 .cse15 .cse9 .cse10 .cse16 .cse21))) [2021-10-13 06:45:34,321 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 169) no Hoare annotation was computed. [2021-10-13 06:45:34,322 INFO L853 garLoopResultBuilder]: At program point L13-1(lines 160 208) the Hoare annotation is: (let ((.cse9 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~q_write_ev~0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse4 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse8 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse11 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (= ~q_req_up~0 (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse12 (= (_ bv2 32) ~q_read_ev~0) .cse3 .cse13 .cse4 .cse5 (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) .cse8 (= ~q_req_up~0 (_ bv0 32)) .cse9 .cse10 .cse14 .cse11 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse14 .cse11))) [2021-10-13 06:45:34,322 INFO L853 garLoopResultBuilder]: At program point L393(lines 382 395) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse20 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse14 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse15 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~c_dr_pc~0 (_ bv1 32))) (.cse21 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 (_ bv0 32)) .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse14 .cse15 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse10 .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse17 .cse6 .cse8 .cse14 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse20 .cse8 .cse14 (= ~p_dw_st~0 (_ bv0 32)) .cse16 .cse21 .cse18 .cse19 .cse12) (and .cse13 .cse0 .cse17 .cse4 .cse6 .cse20 .cse14 .cse15 .cse9 .cse10 .cse16 .cse21))) [2021-10-13 06:45:34,322 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 367) no Hoare annotation was computed. [2021-10-13 06:45:34,323 INFO L853 garLoopResultBuilder]: At program point L394(lines 378 396) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse13 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse20 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse14 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse15 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~c_dr_pc~0 (_ bv1 32))) (.cse21 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_req_up~0 (_ bv0 32)) .cse12) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse8 .cse14 .cse15 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse14 .cse10 .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse17 .cse6 .cse8 .cse14 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse16 .cse18 .cse19) (and .cse13 .cse0 .cse2 .cse4 .cse6 .cse20 .cse8 .cse14 (= ~p_dw_st~0 (_ bv0 32)) .cse16 .cse21 .cse18 .cse19 .cse12) (and .cse13 .cse0 .cse17 .cse4 .cse6 .cse20 .cse14 .cse15 .cse9 .cse10 .cse16 .cse21))) [2021-10-13 06:45:34,323 INFO L857 garLoopResultBuilder]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2021-10-13 06:45:34,323 INFO L853 garLoopResultBuilder]: At program point L411-1(lines 281 433) the Hoare annotation is: (let ((.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse22 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= ~q_req_up~0 (_ bv0 32))) (.cse19 (= ~q_free~0 (_ bv1 32))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse21 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse15 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse16 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~c_dr_pc~0 (_ bv1 32))) (.cse23 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse2 .cse4 .cse6 .cse8 .cse15 .cse16 .cse9 .cse10 .cse17) (and .cse0 .cse18 .cse4 .cse6 .cse8 .cse15 .cse9 .cse10 .cse17) (and .cse0 .cse18 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse18 .cse4 .cse6 .cse8 .cse15 .cse10 .cse17 .cse19 .cse20) (and .cse14 .cse0 .cse18 .cse6 .cse8 .cse15 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse17 .cse19 .cse20) (and .cse14 .cse0 .cse2 .cse4 .cse6 .cse21 .cse8 .cse15 .cse22 .cse17 .cse23 .cse19 .cse20 .cse13) (and .cse0 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) .cse22 .cse11 .cse12 .cse19 .cse13 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse14 .cse0 .cse18 .cse4 .cse6 .cse21 .cse15 .cse16 .cse9 .cse10 .cse17 .cse23))) [2021-10-13 06:45:34,323 INFO L857 garLoopResultBuilder]: For program point L345(lines 345 352) no Hoare annotation was computed. [2021-10-13 06:45:34,323 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-10-13 06:45:34,324 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 168) no Hoare annotation was computed. [2021-10-13 06:45:34,324 INFO L853 garLoopResultBuilder]: At program point L131-1(lines 119 154) the Hoare annotation is: (let ((.cse2 (= ~q_req_up~0 (_ bv1 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse1 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse7 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= (_ bv2 32) ~q_write_ev~0)) (.cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse14 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse5 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse10 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse16 (= ~c_dr_pc~0 (_ bv0 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse11 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 (not .cse2) .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 (= ~p_num_write~0 (_ bv1 32)) .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse10 .cse16 .cse17 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse18 (= ~p_num_write~0 ~c_num_read~0) .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 (= ~p_num_write~0 (_ bv0 32)) .cse10 .cse16 (= ~q_req_up~0 (_ bv0 32)) .cse18 .cse17 .cse11))) [2021-10-13 06:45:34,324 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 06:45:34,324 INFO L857 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2021-10-13 06:45:34,324 INFO L857 garLoopResultBuilder]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L857 garLoopResultBuilder]: For program point L412(line 412) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L857 garLoopResultBuilder]: For program point L247(lines 247 257) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L857 garLoopResultBuilder]: For program point L214(lines 214 220) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L857 garLoopResultBuilder]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2021-10-13 06:45:34,325 INFO L853 garLoopResultBuilder]: At program point L214-1(lines 229 233) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,326 INFO L857 garLoopResultBuilder]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2021-10-13 06:45:34,326 INFO L853 garLoopResultBuilder]: At program point L214-3(lines 210 224) the Hoare annotation is: (let ((.cse2 (not (= (_ bv1 32) ~q_write_ev~0))) (.cse12 (= ~q_req_up~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 (_ bv1 32))) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse14 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= (_ bv2 32) ~q_write_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse15 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse10 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~c_dr_pc~0 (_ bv1 32))) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse2 .cse4 .cse6 .cse8 .cse15 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse9 .cse10 .cse16) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse15 .cse9 .cse10 .cse16) (and .cse14 .cse0 .cse17 .cse6 .cse8 .cse10 .cse16 .cse12 .cse18 .cse19) (and .cse0 .cse17 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse17 .cse4 .cse6 .cse8 .cse15 .cse10 .cse16 .cse18 .cse19) (and .cse14 .cse0 .cse17 .cse6 .cse8 .cse15 .cse10 (not (= (_ bv0 32) ~q_read_ev~0)) .cse16 .cse18 .cse19))) [2021-10-13 06:45:34,326 INFO L853 garLoopResultBuilder]: At program point L165(lines 160 208) the Hoare annotation is: (and (= ~p_dw_pc~0 (_ bv1 32)) (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= ~p_dw_i~0 (_ bv1 32)) (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32)) (not (= ~c_dr_st~0 (_ bv0 32))) (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) (= ~p_dw_st~0 (_ bv2 32)) (not (= (_ bv0 32) ~q_read_ev~0)) (= ~c_dr_pc~0 (_ bv1 32)) (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2) (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32))) [2021-10-13 06:45:34,326 INFO L857 garLoopResultBuilder]: For program point L132(lines 131 149) no Hoare annotation was computed. [2021-10-13 06:45:34,327 INFO L853 garLoopResultBuilder]: At program point L133(lines 119 154) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~q_read_ev~0)) (.cse2 (= ~p_dw_i~0 (_ bv1 32))) (.cse3 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse4 (= |ULTIMATE.start_exists_runnable_thread_#res| (_ bv1 32))) (.cse5 (= (_ bv1 32) ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse6 (= ULTIMATE.start_eval_~tmp___1~0 (_ bv1 32)))) (or (and .cse0 (not (= (_ bv1 32) ~q_write_ev~0)) .cse1 .cse2 .cse3 .cse4 (not (= ~c_dr_st~0 (_ bv0 32))) (= ~c_dr_pc~0 (_ bv1 32)) .cse5 (= ~p_num_write~0 ~c_num_read~0) .cse6) (and .cse0 (= (_ bv2 32) ~q_write_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) .cse1 (= ~c_num_read~0 (_ bv0 32)) .cse2 .cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse4 (= ~p_num_write~0 (_ bv0 32)) .cse5 (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32)) .cse6))) [2021-10-13 06:45:34,327 INFO L857 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-10-13 06:45:34,327 INFO L853 garLoopResultBuilder]: At program point L315-2(lines 285 289) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32)) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,327 INFO L857 garLoopResultBuilder]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2021-10-13 06:45:34,328 INFO L853 garLoopResultBuilder]: At program point L315-5(lines 285 289) the Hoare annotation is: (let ((.cse20 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= (_ bv1 32) ~q_read_ev~0)) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse17 (= ~p_dw_pc~0 (_ bv1 32))) (.cse6 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse21 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse10 (= ~c_dr_pc~0 (_ bv1 32))) (.cse18 (= (_ bv1 32) ~q_write_ev~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~p_num_write~0 (_ bv1 32))) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse23 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 (_ bv0 32))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse9 (= ~p_dw_st~0 (_ bv2 32))) (.cse24 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 (_ bv0 32))) (.cse11 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32)))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse11)) .cse14 .cse15 .cse16) (and .cse17 .cse0 (not .cse18) .cse14 .cse3 .cse15 .cse5 .cse6 (= ~p_dw_st~0 (_ bv0 32)) .cse10 .cse12 .cse13 .cse16 .cse19) (and .cse17 .cse0 .cse1 .cse14 .cse3 .cse15 .cse5 .cse6 .cse9 .cse20 .cse10 .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse14 .cse3 .cse15 .cse5 .cse6 .cse9 .cse20 .cse10 .cse12 .cse13 .cse16 .cse19) (and .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11) (and .cse0 .cse1 .cse22 .cse14 .cse2 .cse23 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse16 .cse11) (and .cse17 .cse0 .cse2 .cse3 .cse4 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11) (and .cse0 .cse22 .cse14 .cse2 .cse23 .cse3 .cse15 .cse4 .cse5 .cse7 .cse8 .cse9 .cse24 (= ~q_req_up~0 (_ bv0 32)) .cse16 .cse11))) [2021-10-13 06:45:34,328 INFO L857 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-10-13 06:45:34,328 INFO L853 garLoopResultBuilder]: At program point L68(lines 56 70) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 06:45:34,328 INFO L853 garLoopResultBuilder]: At program point L68-1(lines 56 70) the Hoare annotation is: (let ((.cse10 (= ~p_num_write~0 (_ bv1 32))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse12 (= ~c_num_read~0 (_ bv0 32))) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse19 (not (= (_ bv0 32) ~q_read_ev~0))) (.cse16 (= ~q_free~0 (_ bv1 32))) (.cse17 (= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= (_ bv1 32) ~q_read_ev~0)) (.cse15 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_dw_i~0 (_ bv1 32))) (.cse4 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (not (= ~q_req_up~0 (_ bv1 32)))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse9 (= ~c_dr_pc~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse7 .cse8 .cse14 (= ~q_req_up~0 (_ bv0 32))) (and .cse15 .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse16 .cse17) (and .cse15 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse16 .cse17) (and .cse0 .cse1 .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse16 .cse17 .cse18) (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6 .cse7 .cse8 .cse9))) [2021-10-13 06:45:34,333 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 06:45:34,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:45:34 BoogieIcfgContainer [2021-10-13 06:45:34,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 06:45:34,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 06:45:34,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 06:45:34,426 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 06:45:34,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:34" (3/4) ... [2021-10-13 06:45:34,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 06:45:34,443 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 06:45:34,444 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 06:45:34,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 06:45:34,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 06:45:34,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 [2021-10-13 06:45:34,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 [2021-10-13 06:45:34,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 [2021-10-13 06:45:34,471 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32 [2021-10-13 06:45:34,472 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,472 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,472 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) [2021-10-13 06:45:34,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) [2021-10-13 06:45:34,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || ((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) [2021-10-13 06:45:34,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) [2021-10-13 06:45:34,473 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) && q_free == 1bv32) && p_num_write == c_num_read) || ((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(tmp___1 == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32))) || ((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(tmp___1 == 0bv32)) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) [2021-10-13 06:45:34,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || ((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) [2021-10-13 06:45:34,474 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32) && 1bv32 == q_read_ev)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32) [2021-10-13 06:45:34,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32)) || (((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) [2021-10-13 06:45:34,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && p_num_write == c_num_read) && tmp___1 == 1bv32) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) [2021-10-13 06:45:34,475 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && q_req_up == 1bv32) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && 1bv32 == __retres1) && tmp___0 == 0bv32) && tmp___1 == 1bv32) [2021-10-13 06:45:34,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32 [2021-10-13 06:45:34,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32) [2021-10-13 06:45:34,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32) && \result == 0bv32) [2021-10-13 06:45:34,476 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32) && \result == 0bv32) && tmp___0 == 0bv32) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && tmp___0 == 0bv32) && \result == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) [2021-10-13 06:45:34,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) [2021-10-13 06:45:34,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,477 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) [2021-10-13 06:45:34,516 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 06:45:34,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 06:45:34,519 INFO L168 Benchmark]: Toolchain (without parser) took 60716.66 ms. Allocated memory was 67.1 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 46.2 MB in the beginning and 646.7 MB in the end (delta: -600.4 MB). Peak memory consumption was 468.6 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,519 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 67.1 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:45:34,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.95 ms. Allocated memory is still 67.1 MB. Free memory was 46.1 MB in the beginning and 48.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.36 ms. Allocated memory is still 67.1 MB. Free memory was 48.5 MB in the beginning and 46.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,521 INFO L168 Benchmark]: Boogie Preprocessor took 41.76 ms. Allocated memory is still 67.1 MB. Free memory was 46.2 MB in the beginning and 44.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:45:34,521 INFO L168 Benchmark]: RCFGBuilder took 614.59 ms. Allocated memory is still 67.1 MB. Free memory was 44.3 MB in the beginning and 45.0 MB in the end (delta: -689.2 kB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,522 INFO L168 Benchmark]: TraceAbstraction took 59584.66 ms. Allocated memory was 67.1 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 44.5 MB in the beginning and 654.0 MB in the end (delta: -609.5 MB). Peak memory consumption was 713.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,522 INFO L168 Benchmark]: Witness Printer took 91.25 ms. Allocated memory is still 1.1 GB. Free memory was 652.9 MB in the beginning and 646.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 06:45:34,524 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 67.1 MB. Free memory is still 47.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 330.95 ms. Allocated memory is still 67.1 MB. Free memory was 46.1 MB in the beginning and 48.5 MB in the end (delta: -2.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.36 ms. Allocated memory is still 67.1 MB. Free memory was 48.5 MB in the beginning and 46.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.76 ms. Allocated memory is still 67.1 MB. Free memory was 46.2 MB in the beginning and 44.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 614.59 ms. Allocated memory is still 67.1 MB. Free memory was 44.3 MB in the beginning and 45.0 MB in the end (delta: -689.2 kB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 59584.66 ms. Allocated memory was 67.1 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 44.5 MB in the beginning and 654.0 MB in the end (delta: -609.5 MB). Peak memory consumption was 713.1 MB. Max. memory is 16.1 GB. * Witness Printer took 91.25 ms. Allocated memory is still 1.1 GB. Free memory was 652.9 MB in the beginning and 646.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 59409.4ms, OverallIterations: 21, TraceHistogramMax: 6, EmptinessCheckTime: 69.3ms, AutomataDifference: 5343.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 27497.1ms, InitialAbstractionConstructionTime: 15.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3087 SDtfs, 3247 SDslu, 3951 SDs, 0 SdLazy, 346 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 412.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3410 GetRequests, 3362 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 220.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5419occurred in iteration=11, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4428.1ms AutomataMinimizationTime, 21 MinimizatonAttempts, 9401 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 311 NumberOfFragments, 7237 HoareAnnotationTreeSize, 33 FomulaSimplifications, 320936 FormulaSimplificationTreeSizeReduction, 3253.1ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 127361 FormulaSimplificationTreeSizeReductionInter, 24218.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 319.4ms SsaConstructionTime, 958.6ms SatisfiabilityAnalysisTime, 8983.9ms InterpolantComputationTime, 1721 NumberOfCodeBlocks, 1721 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3396 ConstructedInterpolants, 0 QuantifiedInterpolants, 5497 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3331 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 46 InterpolantComputations, 40 PerfectInterpolantSequences, 1332/1344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32) && \result == 0bv32) && tmp___0 == 0bv32) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && tmp___0 == 0bv32) && \result == 0bv32)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32)) || (((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || ((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) && tmp___0 == 0bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && p_num_write == c_num_read) && tmp___1 == 1bv32) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && q_req_up == 1bv32) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && 1bv32 == __retres1) && tmp___0 == 0bv32) && tmp___1 == 1bv32) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32 - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == q_write_ev) && \result == 0bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && __retres1 == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && tmp == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) && __retres1 == 0bv32) && \result == 0bv32) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: !(0bv32 == q_read_ev) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) && q_free == 1bv32) && p_num_write == c_num_read) || ((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(tmp___1 == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32))) || ((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && !(tmp___1 == 0bv32)) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && !(tmp___1 == 0bv32)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && p_num_write == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || ((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32)) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && \result == 0bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && 1bv32 == q_read_ev)) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && \result == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && \result == 0bv32)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32) && 1bv32 == q_read_ev)) || ((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && __retres1 == 0bv32) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read) && \result == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && \result == 0bv32) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32) || (((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && tmp___1 == 1bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32)) || (((((((((((p_last_write == q_buf_0 && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 1bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___1 == 1bv32)) || (((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && tmp___1 == 1bv32) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: !(0bv32 == q_read_ev) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) || (((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && q_req_up == 1bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && q_free == 0bv32) && p_dw_st == 2bv32) && 1bv32 == __retres1) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 0bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_req_up == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32) && tmp___1 == 1bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && !(1bv32 == q_write_ev)) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && tmp___0 == 0bv32) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || ((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32)) || (((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && p_num_write == 1bv32) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || ((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && p_dw_i == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 2bv32) && !(0bv32 == q_read_ev)) && c_dr_pc == 1bv32) && q_free == 1bv32) && p_num_write == c_num_read)) || (((((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(1bv32 == q_write_ev)) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(c_dr_st == 0bv32)) && !(q_req_up == 1bv32)) && p_dw_st == 0bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) && q_free == 1bv32) && p_num_write == c_num_read) && tmp___0 == 0bv32)) || ((((((((((((((p_last_write == q_buf_0 && 2bv32 == q_write_ev) && __retres1 == 0bv32) && 2bv32 == q_read_ev) && c_num_read == 0bv32) && p_dw_i == 1bv32) && \result == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_req_up == 0bv32) && q_free == 1bv32) && tmp___0 == 0bv32) && p_dw_pc == 0bv32)) || (((((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && 2bv32 == q_write_ev) && 2bv32 == q_read_ev) && p_dw_i == 1bv32) && \result == 1bv32) && !(q_req_up == 1bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32) && c_dr_pc == 1bv32) && 1bv32 == __retres1) RESULT: Ultimate proved your program to be correct! [2021-10-13 06:45:34,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35b017c7-9d7c-42d8-948a-0e049426b053/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...